Paper: Efficient Construction Of Underspecified Semantics Under Massive Ambiguity

ACL ID P97-1050
Title Efficient Construction Of Underspecified Semantics Under Massive Ambiguity
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1997
Authors

We investigate the problem of determin- ing a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building se- mantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntac- tic parse forest with associated constraint- based semantic construction rules and di- rectly builds a packed semantic structure. The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable 'nor- mality' restrictions. 1 Background One of the most central problems that any NL sys- tem must face is the ubiquitous phenomenon of am- biguity. In the last few years a whole new branch de- veloped in semantics that inve...