Representing Unish Grammars Based on Tree Adjoining Grammar Formalisms
Published Online: Jan 01, 2017
Abstract
To make any sort of optimality argument, or rational engineering decision, one needs a fairly precise understanding of the problem to be tackled. Thus the purpose of this paper is to formalize Unish grammar by developing prototype Unish Tree Adjoining Grammars in the hope that developing and formalizing Unish grammars at this stage will help to direct the way the future version of Unish should be tailored and modified, as an artificial language.
Metrics
QR Code of this Article:
Related Articles
Multilingualism, Social Inequality, and the Need for a Universal Language
J. Univers. Lang. 2023;24(1):77-93.
Language Universals and Universal Language: The Case of the Accessibility Hierarchy in Relativization
J. Univers. Lang. 2002;3(2):113-137.
Situation Aspect as a Universal Aspect*: Implications for Artificial Languages
J. Univers. Lang. 2002;3(2):139-177.
Linguistic Diversity and Justice: The Role of Artificial Languages in Multilingual Societies
J. Univers. Lang. 2023;24(2):71-89.
Principles of Developing Lexicon in Artificial Languages: Based on an Empirical Study
J. Univers. Lang. 2017;18(2):89-104.
