Paper Info
Title
Regular Tree Grammars as a Formalism for Scope Underspecification
Abstract
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 tradi- tional underspecified descriptions.
Year
Venue
Field
2008
ACL
Underspecification,Computer science,Tree grammars,Theoretical computer science,Formalism (philosophy),Ambiguity
DocType
Volume
Citations 
Conference
P08-1
8
PageRank 
References 
Authors
0.62
16
3
Name
Order
Citations
PageRank
Alexander Koller143835.50
Michaela Regneri21437.44
Stefan Thater375638.54