| model,13-1-P06-1052,ak | elimination problem </term> : Given an <term> | underspecified semantic representation ( USR ) | </term> of a <term> scope ambiguity </term> | #12068 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. |
