| other,21-3-P06-1052,ak | significantly while taking negligible <term> | runtime | </term> . In this paper , we describe the | #12135 We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime . | |
| tech,1-2-P06-1052,ak | equivalent <term> readings </term> . The <term> | algorithm | </term> operates on <term> underspecified | #12089 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. | |
| model,26-1-P06-1052,ak | scope ambiguity </term> , compute an <term> | USR | </term> with fewer mutually equivalent <term> | #12081 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,ak | evaluate the <term> algorithm </term> on a <term> | corpus | </term> , and show that it reduces the degree | #12120 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,ak | show that it reduces the degree of <term> | ambiguity | </term> significantly while taking negligible | #12130 We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime. | |
| tech,4-1-P06-1052,ak | LFG </term> . We present an efficient <term> | algorithm | </term> for the <term> redundancy elimination | #12059 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. | |
| tech,3-3-P06-1052,ak | grammars </term> . We evaluate the <term> | algorithm | </term> on a <term> corpus </term> , and show | #12117 We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime. |
