RULE-BASED SYNTACTIC ANALYSIS ALGORITHM FOR THE UZBEK LANGUAGE
Article Sidebar
Main Article Content
Abstract
Natural Language Processing (NLP) plays a crucial role in developing intelligent systems for linguistic analysis, machine translation, and text generation. Uzbek language is a member of the Turkic language family, poses unique challenges in syntactic analysis due to its agglutinative nature and free word order. This proposal presents a rule-based approach to syntactic analysis for the Uzbek language, focusing on identifying grammatical roles such as subject (ega), predicate (kesim), object (to‘ldiruvchi), and adverbial modifier (hol).
Article Details
References
Chomsky, N. (1957). Syntactic Structures. The Hague: Mouton.
Karlsson, F. (1990). Constraint Grammar as a Framework for Parsing Running Text. In Proceedings of COLING-90, Helsinki, Finland.
Oflazer, K. (1994). Two-level Description of Turkish Morphology. Literary and Linguistic Computing, 9(2), 137-148.
Turdiev, S. (2008). Uzbek Morphological Analysis and Lexicon Development. Tashkent State University.
Rakhmatullaev, M., Nurmatov, A., & Yuldashev, U. (2015). Statistical Parsing Approaches for Uzbek Language Processing. Uzbek Journal of Computational Linguistics, 3(1), 45-60.
Tadjibayev, N. (2020). Dependency Parsing for the Uzbek Language: A Rule-Based Approach. International Journal of Turkic Studies, 27(2), 125-142.
Çöltekin, Ç. (2010). A Freely Available Morphological Analyzer for Turkish. In Proceedings of the International Conference on Computational Linguistics (COLING), Beijing, China.