Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Multitext Grammars and synchronous parsers
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Generalized multitext grammars
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
IEICE - Transactions on Information and Systems
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
The weak generative capacity of linear tree-adjoining grammars
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Binarization of synchronous context-free grammars
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
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
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
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Theoretical Computer Science
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
Well-nestedness properly subsumes strict derivational minimalism
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
A note on the complexity of constraint interaction: locality conditions and minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
The copying power of well-nested multiple context-free grammars
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Chomsky-Schützenberger-type characterization of multiple context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 5.23 |