Regular Tree Grammars as a Formalism for Scope Underspecification

We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel algorithm for eliminating equivalent readings and the first efficient algorithm for computing the best reading of a scope ambiguity. We also show how to derive RTGs from more traditional underspecified descriptions.

• Type: Conference
• Year: 2008
• Where: ACL
• Authors: Alexander Koller, Michaela Regneri, Stefan Thater
• Keywords: ACL 2008, Computational Linguistics, Regular Tree Grammars, Scope Ambiguities, Scope Ambiguity