IDEAS home Printed from https://ideas.repec.org/a/igg/jdsst0/v14y2022i1p1-24.html
   My bibliography  Save this article

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

Author

Listed:
  • Sagarika Pattnaik

    (Department of Computer Science and Engineering, Siksha 'O' Anusandhan (Deemed), India)

  • Ajit Kumar Nayak

    (Department of Computer Science and Engineering, Siksha 'O' Anusandhan (Deemed), India)

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).

Suggested Citation

  • Sagarika Pattnaik & Ajit Kumar Nayak, 2022. "A Modified Markov-Based Maximum-Entropy Model for POS Tagging of Odia Text," International Journal of Decision Support System Technology (IJDSST), IGI Global, vol. 14(1), pages 1-24, January.
    • Handle: RePEc:igg:jdsst0:v:14:y:2022:i:1:p:1-24
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDSST.286690
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdsst0:v:14:y:2022:i:1:p:1-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.