Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Head automata and bilingual tiling: translation with minimal representations
ACL '96 Proceedings of the 34th 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
Efficient parsing for bilexical context-free grammars and head automaton grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Head-Driven Statistical Models for Natural Language Parsing
Computational Linguistics
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models have running time of O(â聢拢wâ聢拢4), where w is the input string. A 2-LCFG is splittable if the left arguments of a lexical head are always independent of the right arguments, and vice versa. When a 2-LCFGs is splittable, parsing time can be asymptotically improved to O(â聢拢wâ聢拢3). Testing this property is therefore of central interest to parsing efficiency. In this article, however, we show the negative result that splittability of 2-LCFGs is undecidable.