| other,31-1-P06-1052,ak | </term> with fewer mutually equivalent <term> | readings | </term> . The <term> algorithm </term> operates | #12086 We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings . | |
| model,20-2-P06-1052,ak | </term> ; it can be applied to the <term> | USRs | </term> computed by <term> large-scale grammars | #12108 The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. |
