Regular Closure of Deterministic Languages
SIAM Journal on Computing
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Three generative, lexicalised models for statistical parsing
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
Bayesian grammar induction for language modeling
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Noun classification from predicate-argument structures
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Two principles of parse preference
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
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
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Corpus-based induction of syntactic structure: models of dependency and constituency
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
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
Maximum entropy estimation for feature forests
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Graph transformations in data-driven dependency parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Annealing structural bias in multilingual weighted grammar induction
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Advances in discriminative parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Unlexicalised hidden variable models of split dependency grammars
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Vine parsing and minimum risk reranking for speed and precision
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Graph-based text representation for novelty detection
TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
Semi-supervised learning of dependency parsers using generalized expectation criteria
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Using a maximum entropy-based tagger to improve a very fast vine parser
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
An efficient algorithm for easy-first non-directional dependency parsing
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Fast and accurate arc filtering for dependency parsing
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Joint training of dependency parsing filters through latent support vector machines
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Punctuation: making a point in unsupervised dependency parsing
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
From ranked words to dependency trees: two-stage unsupervised non-projective dependency parsing
TextGraphs-6 Proceedings of TextGraphs-6: Graph-based Methods for Natural Language Processing
Natural Language Compression on Edge-Guided text preprocessing
Information Sciences: an International Journal
Predicting thread discourse structure over technical web forums
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Graph-based term weighting for information retrieval
Information Retrieval
Vine pruning for efficient multi-pass dependency parsing
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Finite-state chart constraints for reduced complexity context-free parsing pipelines
Computational Linguistics
| Hi-index | 0.00 |
In lexicalized phrase-structure or dependency parses, a word's modifiers tend to fall near it in the string. We show that a crude way to use dependency length as a parsing feature can substantially improve parsing speed and accuracy in English and Chinese, with more mixed results on German. We then show similar improvements by imposing hard bounds on dependency length and (additionally) modeling the resulting sequence of parse fragments. This simple "vine grammar" formalism has only finite-state power, but a context-free parameterization with some extra parameters for stringing fragments together. We exhibit a linear-time chart parsing algorithm with a low grammar constant.