Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Linear context-free rewriting systems and deterministic tree-walking transducers
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Refining tabular parsers for TAGs
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
An Earley parsing algorithm for range concatenation grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
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
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
We introduce simple but powerful automata called Thread Automata, to describe a wide range of parsing strategies for Mildly Context-Sensitive languages. Thread Automata are completed by a Dynamic Programming interpretation ensuring that tabular parsing may be performed with polynomial worst-case complexity.