The grammatical basis of linguistic performance: language use and acquisition
The grammatical basis of linguistic performance: language use and acquisition
A formal model for context-free languages augmented with reduplication
Computational Linguistics
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Elements of the Theory of Computation
Elements of the Theory of Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
A study of tree adjoining grammars
A study of tree adjoining grammars
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Mathematics of unbounded duplicative and columnar constructions in chinese
Mathematics of unbounded duplicative and columnar constructions in chinese
Strong generative capacity, weak generative capacity, and modern linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Strict Compositionality and Literal Movement Grammars
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
New developments in parsing technology
An Earley parsing algorithm for range concatenation grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
| Hi-index | 0.00 |
The Tree Adjoining Grammar formalism, both its single- as well as multiple-component versions, has recently received attention as a basis for the description and explication of natural language. We show in this paper that the number-name system of Chinese is generated neither by this formalism nor by any other equivalent or weaker ones, suggesting that such a task might require the use of the more powerful Indexed Grammar formalism. Given that our formal results apply only to a proper subset of Chinese, we extensively discuss the issue of whether they have any implications for the whole of that natural language. We conclude that our results bear directly either on the systax of Chinese or on the interface between Chinese and the cognitive component responsible for arithmetic reasoning. Consequently, either Tree Adjoining Grammars, as currently defined, fail to generate the class of natural languages in a way that discriminates between linguistically warranted sublanguages, or formalisms with generative power equivalent to Tree Adjoining Grammar cannot serve as a basis for the interface between the human linguistic and mathematical faculties.