Sciweavers

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

33

NAACL
2010

favoriteEmaildiscussreport

155views Computational Linguistics» more NAACL 2010»

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

13 years 8 months ago

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

Download www.grupolys.org

The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively free word order. We present a chart-based parsing algorithm that asymptotically improves the known running time upper bound for this class of rewriting systems. Our result is obtained through a linear space construction of a binary normal form for the grammar at hand.

Carlos Gómez-Rodríguez, Marco Kuhlma

Real-time Traffic

Binary Normal Form | Chart-based Parsing Algorithm | Computational Linguistics | Context-Free Rewriting Systems | NAACL 2010 |

claim paper

Related Content

» DataDriven Parsing with Probabilistic Linear ContextFree Rewriting Systems

» Optimal Rank Reduction for Linear ContextFree Rewriting Systems with FanOut Two

» Optimal Parsing Strategies for Linear ContextFree Rewriting Systems

» Optimal HeadDriven Parsing Complexity for Linear ContextFree Rewriting Systems

» Recognition of Linear ContextFree Rewriting Systems

» Querying Parse Trees of Stochastic ContextFree Grammars

» Generalized Multitext Grammars

» Recognizing Plans with Loops Represented in a Lexicalized Grammar

» Predicting Location and Structure Of betaSheet Regions Using Stochastic Tree Grammars

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	NAACL
Authors	Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta

Comments (0)