MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  An earley-type recognizer for dependency grammar (1996) [13 citations — 1 self]

Download:
pdf
by Vincenzo Lombardo, Leonardo Lesmo
In Proceedings of COLING'96
http://acl.ldc.upenn.edu/C/C96/C96-2122.pdf
Add To MetaCart

Abstract:

The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper describes an improved Earley-type recognizer with a complexity O(IGl2n3). The improvement is due to a precompilation of the dependency rules into parse tables, that determine the conditions of applicability of two primary actions, predict and scan, used in recognition. 1

Citations

508 An Efficient Context-Free Parsing Algorithm – Earley - 1970
408 Lexical-Functional Grammar: A formal system for grammatical representation – Kaplan, Bresnan - 1982
208 Dependency Syntax: Theory and Practice – Mel’cuk - 1988
180 Three models for the description of language – Chomsky - 1956
135 English Word Grammar – Hudson - 1991
112 The Convergence of Mildly Context–Sensitive Grammar Formalisms – Joshi, Vijay-Shanker, et al. - 1991
100 X’ syntax: A study of phrase structure – Jackendoff - 1977
82 Dependency systems and phrase-structure systems – Gaifman - 1965
74 An Improved Context-Free Recognizer – Graham, Harrison, et al. - 1980
23 Parsing discontinuous constituents in dependency grammar – Covington - 1990
1 of Georgia (also on CompLing Server – AI-1994-01 - 1994
1 Parsing and Dependency – Fraser - 1989
1 Unification-Based Dependency Parsing – Kwon, Yoon - 1991
1 Dependency Grammar and the Parsing of – Lai, Huang - 1995
1 Studies in Relational Grammar 1, Univ – Perlmutter - 1983
View or Download | Add to My Collection | Correct Errors