Definition of Natural Languages Using Context-free Grammer: In Context of Dari Language
Formal definition of a natural language lets computers understand it; the languages have challenging complexity to come under representation of any formal language. Modeling assumptions, using formal languages, we can approximate the languages; and better approximation we do, more complexities of formal languages are resolved. Objective is to study current researches and possibilities to model Dari as a context-free language. Researchers have worked for more than 6 decades on definition of syntax of natural languages using context-free grammer. It is crucial that computer scientists to be able to thoroughly understand about which category of formal languages the natural language exist in in. In overall, our skill to decide the grammar type of natural languages performs a significant role in our capability to parse it. This review article concludes that discussed issue of the context-freeness of a certain language is regularly reliant on upon the level of complexity of the language. The common of languages investigated in this regard are languages of European family and Indo-Aryan languages liker Dari, Arabic and Pashto have not been adequately fortunate to be devoted thorough researches in this regard.
Chomsky, N., & Schützenberger, M. P. (1963). The algebraic theory of context-free languages. In Studies in Logic and the Foundations of Mathematics (Vol. 35, pp. 118-161). Elsevier.
Ginsburg, S. (1966). The Mathematical Theory of Context Free Languages.[Mit Fig.]. McGraw-Hill Book Company.
Ginsburg, S., & Greibach, S. (1965, October). Deterministic context free languages. In 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)(pp. 203-220). IEEE.
Klabunde, R. (2002). Daniel jurafsky/james h. martin, speech and language processing. Zeitschrift für Sprachwissenschaft, 21(1), 134-135.
Knuth, D. E. (1968). Semantics of context-free languages. Mathematical systems theory, 2(2), 127-145.
Mukhtar, N., Khan, M. A., & Zuhra, F. T. (2011). Probabilistic context free grammar for Urdu. Linguistic and Literature Review, 1(1), 86-94.
Pullum, G. K., & Gazdar, G. (1982). Natural languages and context-free languages. Linguistics and Philosophy, 4(4), 471-504.
Pullum, G. K., & Gazdar, G. (1987). Natural Languages and Context-Free Languages. In The Formal complexity of natural language (pp. 138-182). Springer, Dordrecht.
Shieber, S. M. (1985). Evidence against the context-freeness of natural language. In Philosophy, Language, and Artificial Intelligence (pp. 79-89). Springer, Dordrecht.
Shamsfard, M. (2011). Challenges and open problems in Persian text processing. Proceedings of LTC, 11.
Sundararajan, S. (2007). PROBABILISTIC CONTEXT-FREE GRAMMARS IN NATURAL LANGUAGE PROCESSING.
Younger, D. H. (1967). Recognition and parsing of context-free languages in time n3. Information and control, 10(2), 189-208.
Wang, Y. Y., Mahajan, M., & Huang, X. (2000, June). A unified context-free grammar and n-gram model for spoken language processing. In 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No. 00CH37100) (Vol. 3, pp. 1639-1642). IEEE.
Copyright (c) 2019 Mahmood Asgharzada
This work is licensed under a Creative Commons Attribution 4.0 International License.