MIX Is Not a Tree-Adjoining Language

11 years 7 months ago

Download aclweb.org

The language MIX consists of all strings over the three-letter alphabet {a, b, c} that contain an equal number of occurrences of each letter. We prove Joshi’s (1985) conjecture that MIX is not a tree-adjoining language.

Makoto Kanazawa, Sylvain Salvati

Real-time Traffic

ACL 2012 | Computational Linguistics | Joshi | Language Mix | Letter Alphabet |

claim paper

» Restrictions on Tree Adjoining Languages

» Disfluencies language comprehension and Tree Adjoining Grammars

» Automatically Extracting and Comparing Lexicalized Grammars for Different Languages

» Diagnostic Processing of Japanese for ComputerAssisted Second Language Learning

» Tree Adjoining Grammars Language Bias and Genetic Programming

» A Descriptive Characterization of TreeAdjoining Languages Project Note

» Tabulation of Automata for TreeAdjoining Languages

» Probabilistic TreeAdjoining Grammar As A Framework For Statistical Natural Language Proces...

Post Info
More Details (n/a)

Added	29 Sep 2012
Updated	29 Sep 2012
Type	Journal
Year	2012
Where	ACL
Authors	Makoto Kanazawa, Sylvain Salvati

Comments (0)

Sciweavers

MIX Is Not a Tree-Adjoining Language

ACL 2012 | Computational Linguistics | Joshi | Language Mix | Letter Alphabet |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers