Sciweavers

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

68

ACL
1997

64views Computational Linguistics» more ACL 1997»

The Complexity of Recognition of Linguistically Adequate Dependency Grammars

15 years 4 months ago

The Complexity of Recognition of Linguistically Adequate Dependency Grammars

Download acl.ldc.upenn.edu

Peter Neuhaus, Norbert Bröker

Real-time Traffic

ACL 1997 | ACL 2007 |

claim paper

Related Content

» Problems of Inducing Large Coverage ConstraintBased Dependency Grammar for Czech

» An Earleytype recognizer for dependency grammar

» Inducing TreeSubstitution Grammars

» Linguistic Facts as Predicates over Ranges of the Sentence

» Approximating ContextFree Grammars with a FiniteState Calculus

» From Baby Steps to Leapfrog How Less is More in Unsupervised Dependency Parsing

» Incorporating Linguistic Information to Statistical WordLevel Alignment

» Developing a Deep Linguistic Databank Supporting a Collection of Treebanks the CINTIL Deep...

» Optimal Parsing Strategies for Linear ContextFree Rewriting Systems

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1997
Where	ACL
Authors	Peter Neuhaus, Norbert Bröker

Comments (0)