An open, extendible, and fast Turkish morphological analyzer
MetadataShow full item record
CitationYıldız, O. T., Avar, B. & Ercan, G. (2019). An open, extendible, and fast Turkish morphological analyzer. Paper presented at the International Conference Recent Advances in Natural Language Processing, RANLP, 1364-1372. doi:10.26615/978-954-452-056-4_156
In this paper, we present a two-level morphological analyzer for Turkish which consists of five main components: finite state transducer, rule engine for suffixation, lexicon, trie data structure, and LRU cache. We use Java language to implement finite state machine logic and rule engine, Xml language to describe the finite state transducer rules of the Turkish language, which makes the morphological analyzer both easily extendible and easily applicable to other languages. Empowered with a comprehensive lexicon of 54,000 bare-forms including 19,000 proper nouns, our morphological analyzer is amongst the most reliable analyzers produced so far. The analyzer is compared with Turkish morphological analyzers in the literature. By using LRU cache and a trie data structure, the system can analyze 100,000 words per second, which enables users to analyze huge corpora in a few hours.
SourceInternational Conference Recent Advances in Natural Language Processing, RANLP
The following license files are associated with this item: