other,7-1-P06-1052,bq |
We present an efficient algorithm 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
<term>
equivalent readings
</term>
.
|
#11125
We present an efficient algorithm for theredundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. |