Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ACL
2008

favoriteEmaildiscussreport

98views Computational Linguistics» more ACL 2008»

Regular Tree Grammars as a Formalism for Scope Underspecification

13 years 6 months ago

Regular Tree Grammars as a Formalism for Scope Underspecification

Download aclweb.org

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.

Alexander Koller, Michaela Regneri, Stefan Thater

Real-time Traffic

ACL 2008 | Computational Linguistics | Regular Tree Grammars | Scope Ambiguities | Scope Ambiguity |

claim paper

Related Content

» Feature Unification in TAG Derivation Trees

» HPSGStyle Underspecified Japanese Grammar with Wide Coverage

» A collection of tools for making automata theory and formal languages come alive

» Solving Regular Tree Grammar Based Constraints

» The Dual of Concatenation

» Algorithmic Properties of Millstream Systems

» Why Synchronous Tree Substitution Grammars

» Eliminating Dead Code on Recursive Data

» The HOM problem is decidable

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	ACL
Authors	Alexander Koller, Michaela Regneri, Stefan Thater

Comments (0)