EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Online large-margin training of dependency parsers
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
A best-first probabilistic shift-reduce parser
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
CoNLL-X shared task on multilingual dependency parsing
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Vine parsing and minimum risk reranking for speed and precision
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Incremental integer linear programming for non-projective dependency parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Incrementality in deterministic dependency parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
LTAG dependency parsing with bidirectional incremental construction
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Parser combination by reparsing
NAACL-Short '06 Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers
Parsing with soft and hard constraints on dependency length
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Bilingually-constrained (monolingual) shift-reduce parsing
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
Tree-based deterministic dependency parsing: an application to Nivre's method
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Easy first dependency parsing of modern Hebrew
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Exploiting web-derived selectional preference to improve statistical dependency parsing
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Partial parsing from bitext projections
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Transition-based dependency parsing with rich non-local features
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Learning with lookahead: can history-based models rival globally optimized models?
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
A joint model for extended semantic role labeling
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Syntax-based grammaticality improvement using CCG and guided search
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A fast, accurate, non-projective, semantically-enriched parser
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Third-order variational reranking on packed-shared dependency forests
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Detecting dependency parse errors with minimal resources
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
The best of both worlds: a graph-based completion model for transition-based parsers
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Identifying broken plurals, irregular gender, and rationality in Arabic text
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Syntax-based word ordering incorporating a large-scale language model
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Domain adaptation of a dependency parser with a class-class selectional preference model
ACL '12 Proceedings of ACL 2012 Student Research Workshop
BiuTee: a modular open-source system for recognizing textual entailment
ACL '12 Proceedings of the ACL 2012 System Demonstrations
Fast syntactic analysis for statistical language modeling via substructure sharing and uptraining
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Head-driven transition-based parsing with top-down prediction
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Improving transition-based dependency parsing with buffer transitions
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Learning-based multi-sieve co-reference resolution with knowledge
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
On generating coherent multilingual descriptions of museum objects from semantic web ontologies
INLG '12 Proceedings of the Seventh International Natural Language Generation Conference
Parsing morphologically rich languages: Introduction to the special issue
Computational Linguistics
Dependency parsing of modern standard arabic with lexical and inflectional features
Computational Linguistics
Divisible transition systems and multiplanar dependency parsing
Computational Linguistics
| Hi-index | 0.00 |
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional deterministic parsing algorithms are based on a shift-reduce framework: they traverse the sentence from left-to-right and, at each step, perform one of a possible set of actions, until a complete tree is built. A drawback of this approach is that it is extremely local: while decisions can be based on complex structures on the left, they can look only at a few words to the right. In contrast, our algorithm builds a dependency tree by iteratively selecting the best pair of neighbours to connect at each parsing step. This allows incorporation of features from already built structures both to the left and to the right of the attachment point. The parser learns both the attachment preferences and the order in which they should be performed. The result is a deterministic, best-first, O(nlogn) parser, which is significantly more accurate than best-first transition based parsers, and nears the performance of globally optimized parsing models.