On multiple context-free grammars
Theoretical Computer Science
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
Context-Free Grammars: Covers, Normal Forms, and Parsing
Context-Free Grammars: Covers, Normal Forms, and Parsing
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Generalized multitext grammars
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Empirical lower bounds on the complexity of translational equivalence
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Synchronous binarization for machine translation
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Hierarchical Phrase-Based Translation
Computational Linguistics
Mildly non-projective dependency structures
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Extracting synchronous grammar rules from word-level alignments in linear time
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
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
Parsing mildly non-projective dependency structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
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
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
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
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
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
PLCFRS parsing of English discontinuous constituents
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Discontinuous data-oriented parsing: a mildly context-sensitive all-fragments grammar
SPMRL '11 Proceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages
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
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
Hi-index | 0.00 |
Linear Context-free Rewriting Systems (LCFRS) is an expressive grammar formalism with applications in syntax-based machine translation. The parsing complexity of an LCFRS is exponential in both the rank of a production, defined as the number of nonterminals on its right-hand side, and a measure for the discontinuity of a phrase, called fan-out. In this paper, we present an algorithm that transforms an LCFRS into a strongly equivalent form in which all productions have rank at most 2, and has minimal fan-out. Our results generalize previous work on Synchronous Context-Free Grammar, and are particularly relevant for machine translation from or to languages that require syntactic analyses with discontinuous constituents.