| other,26-1-P06-1052,bq | scope ambiguity </term> , compute an <term> | USR | </term> with fewer mutually <term> equivalent | #11144 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. |
| lr,6-3-P06-1052,bq | </term> . We evaluate the algorithm on a <term> | corpus | </term> , and show that it reduces the degree | #11183 We evaluate the algorithm on a corpus , and show that it reduces the degree of ambiguity significantly while taking negligible runtime. |
| other,16-3-P06-1052,bq | show that it reduces the degree of <term> | ambiguity | </term> significantly while taking negligible | #11193 We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime. |
