Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Parsing discontinuous constituents in dependency grammar
Computational Linguistics
Computational Linguistics - Special issue on inheritance: I
Innovations in text interpretation
Artificial Intelligence - Special volume on natural language processing
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Lexicalized context-free grammars
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Polarized Non-projective Dependency Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
The complexity of recognition of linguistically adequate dependency grammars
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Formal aspects and parsing issues of dependency theory
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Pseudo-projectivity: a polynomially parsable non-projective dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Parsing dependency grammar using ALE
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Grammars for local and long dependencies
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generalized categorial dependency grammars
Pillars of computer science
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
Approximating dependency grammars through intersection of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
| Hi-index | 0.00 |
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(IGI2n3). 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.