Welcome to the InfoSci Platform

A Modified Markov-Based Maximum-Entropy Model for POS Tagging of Odia Text

Sagarika Pattnaik, Ajit Kumar Nayak

Source Title: International Journal of Decision Support System Technology (IJDSST)14(1)

ISSN: 1941-6296|EISSN: 1941-630X|EISBN13: 9781683180890|DOI: 10.4018/IJDSST.286690

MLA

Pattnaik, Sagarika, and Ajit Kumar Nayak. "A Modified Markov-Based Maximum-Entropy Model for POS Tagging of Odia Text." IJDSST vol.14, no.1 2022: pp.1-24. http://doi.org/10.4018/IJDSST.286690

APA

Pattnaik, S. & Nayak, A. K. (2022). A Modified Markov-Based Maximum-Entropy Model for POS Tagging of Odia Text. International Journal of Decision Support System Technology (IJDSST), 14(1), 1-24. http://doi.org/10.4018/IJDSST.286690

Chicago

Pattnaik, Sagarika, and Ajit Kumar Nayak. "A Modified Markov-Based Maximum-Entropy Model for POS Tagging of Odia Text," International Journal of Decision Support System Technology (IJDSST) 14, no.1: 1-24. http://doi.org/10.4018/IJDSST.286690

Export Reference

Favorite Full-Issue Download

View Full Text HTML

View Full Text PDF

Abstract

POS (parts of speech) tagging, a vital step in diverse natural language processing (NLP) tasks, has not drawn much attention in the case of Odia, a computationally under-developed language. The proposed hybrid method suggests a robust POS tagger for Odia. Observing the rich morphology of the language and unavailability of sufficient annotated text corpus, a combination of machine learning and linguistic rules is adopted in the building of the tagger. The tagger is trained on tagged text corpus from the domain of tourism and is capable of obtaining a perceptible improvement in the result. Also, an appreciable performance is observed for news article texts of varied domains. The performance of the proposed algorithm experimenting on Odia language shows its manifestation in dominating existing methods like rule based, hidden Markov model (HMM), maximum entropy (ME), and conditional random field (CRF).