On multiple context-free grammars
Theoretical Computer Science
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A simple pattern-matching algorithm for recovering empty nodes and their antecedents
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Deep syntactic processing by combining shallow methods
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
Probabilistic models of word order and syntactic discontinuity
Probabilistic models of word order and syntactic discontinuity
Computing the most probable parse for a discontinuous phrase structure grammar
New developments in parsing technology
Enriching the output of a parser using memory-based learning
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Using linguistic principles to recover empty categories
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Learning accurate, compact, and interpretable tree annotation
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the 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
Fully parsing the Penn Treebank
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Parsing Discontinuous Phrase Structure with Grammatical Functions
GoTAL '08 Proceedings of the 6th international conference on Advances in Natural Language Processing
Treebank grammar techniques for non-projective dependency parsing
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
A dependency-based method for evaluating broad-coverage parsers
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Stochastic multiple context-free grammar for RNA pseudoknot modeling
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
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
Synchronous rewriting in treebanks
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
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
Parsing Beyond Context-Free Grammars
Parsing Beyond Context-Free Grammars
Characterizing discontinuity in constituent treebanks
FG'09 Proceedings of the 14th international conference on Formal grammar
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
Data-driven parsing using probabilistic linear context-free rewriting systems
Computational Linguistics
| Hi-index | 0.00 |
This paper proposes a direct parsing of non-local dependencies in English. To this end, we use probabilistic linear context-free rewriting systems for data-driven parsing, following recent work on parsing German. In order to do so, we first perform a transformation of the Penn Treebank annotation of non-local dependencies into an annotation using crossing branches. The resulting treebank can be used for PLCFRS-based parsing. Our evaluation shows that, compared to PCFG parsing with the same techniques, PLCFRS parsing yields slightly better results. In particular when evaluating only the parsing results concerning long-distance dependencies, the PLCFRS approach with discontinuous constituents is able to recognize about 88% of the dependencies of type *T* and *T*-PRN encoded in the Penn Treebank. Even the evaluation results concerning local dependencies, which can in principle be captured by a PCFG-based model, are better with our PLCFRS model. This demonstrates that by discarding information on non-local dependencies the PCFG model loses important information on syntactic dependencies in general.