Paper: An Improved Redundancy Elimination Algorithm For Underspecified Representations

ACL ID P06-1052
Title An Improved Redundancy Elimination Algorithm For Underspecified Representations
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2006
Authors

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 read- ings. Thealgorithm operateson underspec- ified chart representations which are de- rived from dominance graphs; it can be ap- plied to the USRs computed by large-scale grammars. We evaluate the algorithm on a corpus, and show that it reduces the de- gree of ambiguity significantly while tak- ing negligible runtime.