On multiple context-free grammars
Theoretical Computer Science
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th 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
Pseudo-projective dependency parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
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
Mildly non-projective dependency structures
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
Experiments with a multilanguage non-projective dependency parser
CoNLL-X '06 Proceedings of the Tenth 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
On the complexity of non-projective data-driven dependency parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Corrective modeling for non-projective dependency parsing
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
Online graph planarisation for synchronous parsing of semantic and syntactic dependencies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Non-projective dependency parsing in expected linear time
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
An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two
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 2 - Volume 2
An incremental earley parser for simple range concatenation grammar
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal parsing strategies for linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Optimal rank reduction for linear context-free rewriting systems with fan-out two
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Detecting errors in automatically-parsed dependency relations
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A transition-based parser for 2-planar dependency structures
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Direct parsing of discontinuous constituents in German
SPMRL '10 Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages
Data-driven parsing with probabilistic linear context-free rewriting systems
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Grammar factorization by tree decomposition
Computational Linguistics
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
Optimal head-driven parsing complexity for linear context-free rewriting systems
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Exact inference for generative probabilistic non-projective dependency parsing
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Efficient parsing with linear context-free rewriting systems
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Generalized higher-order dependency parsing with cube pruning
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Data-driven parsing using probabilistic linear context-free rewriting systems
Computational Linguistics
Mildly non-projective dependency grammar
Computational Linguistics
Divisible transition systems and multiplanar dependency parsing
Computational Linguistics
Hi-index | 0.00 |
An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly context-sensitive grammar formalisms. In this paper, we provide two key tools for this approach. First, we show how to reduce non-projective dependency parsing to parsing with Linear Context-Free Rewriting Systems (LCFRS), by presenting a technique for extracting LCFRS from dependency treebanks. For efficient parsing, the extracted grammars need to be transformed in order to minimize the number of nonterminal symbols per production. Our second contribution is an algorithm that computes this transformation for a large, empirically relevant class of grammars.