| tech,4-1-P06-1052,ak | We present an efficient <term> algorithm </term> for the <term> redundancy elimination problem </term> : Given an <term> underspecified semantic representation ( USR ) </term> of a <term> scope ambiguity </term> , compute an <term> USR </term> with fewer mutually equivalent <term> readings </term> . | #12059 We present an efficientalgorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. |
