On parsing coupled-context-free languages
Theoretical Computer Science
Handbook of formal languages, vol. 3
An efficient context-free parsing algorithm
Communications of the ACM
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Pseudo-projectivity: a polynomially parsable non-projective dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Recognition of linear context-free rewriting systems
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Three new probabilistic models for dependency parsing: an exploration
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
An Earley-type recognizer for dependency grammar
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Question answering passage retrieval using dependency relations
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Online large-margin training of dependency parsers
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Pseudo-projective dependency parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Machine translation using probabilistic synchronous dependency insertion grammars
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Multilingual dependency parsing using Bayes Point Machines
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
RelEx---Relation extraction using dependency parse trees
Bioinformatics
Mildly non-projective dependency structures
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
A compiler for parsing schemata
Software—Practice & Experience
Experiments with a multilanguage non-projective dependency parser
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Labeled pseudo-projective dependency parsing with support vector machines
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
A cascaded syntactic and semantic dependency parsing system
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Optimal reduction of rule length in linear context-free rewriting systems
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Textual entailment recognition based on dependency analysis and wordnet
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
Exact inference for generative probabilistic non-projective dependency parsing
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Dynamic programming for higher order parsing of gap-minding trees
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Mildly non-projective dependency grammar
Computational Linguistics
Divisible transition systems and multiplanar dependency parsing
Computational Linguistics
| Hi-index | 0.00 |
We introduce dependency parsing schemata, a formal framework based on Sikkel's parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use the framework to define new polynomial-time parsing algorithms for various mildly non-projective dependency formalisms, including well-nested structures with their gap degree bounded by a constant k in time O(n5+2k), and a new class that includes all gap degree k structures present in several natural language treebanks (which we call mildly ill-nested structures for gap degree k) in time O(n4+3k). Finally, we illustrate how the parsing schema framework can be applied to Link Grammar, a dependency-related formalism.