Sciweavers

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

10

COLING
2002

favoriteEmaildiscussreport

95views Computational Linguistics» more COLING 2002»

Guaranteeing Parsing Termination of Unification Grammars

13 years 4 months ago

Guaranteeing Parsing Termination of Unification Grammars

Download acl.ldc.upenn.edu

Unification grammars are known to be Turingequivalent; given a grammar and a word

Efrat Jaeger, Nissim Francez, Shuly Wintner

Real-time Traffic

COLING 2002 | COLING 2008 | Grammar | Off-line Parsability | Unification Grammars |

claim paper

Related Content

» A Generalized Greibach Normal Form for Definite Clause Grammars

» Evolutionary Parsing for a Probabilistic Context Free Grammar

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COLING
Authors	Efrat Jaeger, Nissim Francez, Shuly Wintner

Comments (0)