IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i2p435-d1035281.html
   My bibliography  Save this article

Contextual Urdu Lemmatization Using Recurrent Neural Network Models

Author

Listed:
  • Rabab Hafeez

    (Department of Computer Science, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan)

  • Muhammad Waqas Anwar

    (Department of Computer Science, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan)

  • Muhammad Hasan Jamal

    (Department of Computer Science, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan)

  • Tayyaba Fatima

    (Department of Computer Science, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan)

  • Julio César Martínez Espinosa

    (Higher Polytechnic School, Universidad Europea del Atlántico, Isabel Torres 21, 39011 Santander, Spain
    Department of Project Management, Universidad Internacional Iberoamericana, Campeche 24560, Mexico
    Department of Project Management, Universidade Internacional do Cuanza, Cuito EN250, Bié, Angola)

  • Luis Alonso Dzul López

    (Higher Polytechnic School, Universidad Europea del Atlántico, Isabel Torres 21, 39011 Santander, Spain
    Department of Project Management, Universidad Internacional Iberoamericana, Campeche 24560, Mexico
    Project Management, Universidad Internacional Iberoamericana, Arecibo, PR 00613, USA)

  • Ernesto Bautista Thompson

    (Higher Polytechnic School, Universidad Europea del Atlántico, Isabel Torres 21, 39011 Santander, Spain
    Department of Project Management, Universidad Internacional Iberoamericana, Campeche 24560, Mexico
    Fundación Universitaria Internacional de Colombia Bogotá, Bogota 111311, Colombia)

  • Imran Ashraf

    (Department of Information and Communication Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea)

Abstract

In the field of natural language processing, machine translation is a colossally developing research area that helps humans communicate more effectively by bridging the linguistic gap. In machine translation, normalization and morphological analyses are the first and perhaps the most important modules for information retrieval (IR). To build a morphological analyzer, or to complete the normalization process, it is important to extract the correct root out of different words. Stemming and lemmatization are techniques commonly used to find the correct root words in a language. However, a few studies on IR systems for the Urdu language have shown that lemmatization is more effective than stemming due to infixes found in Urdu words. This paper presents a lemmatization algorithm based on recurrent neural network models for the Urdu language. However, lemmatization techniques for resource-scarce languages such as Urdu are not very common. The proposed model is trained and tested on two datasets, namely, the Urdu Monolingual Corpus (UMC) and the Universal Dependencies Corpus of Urdu (UDU). The datasets are lemmatized with the help of recurrent neural network models. The Word2Vec model and edit trees are used to generate semantic and syntactic embedding. Bidirectional long short-term memory (BiLSTM), bidirectional gated recurrent unit (BiGRU), bidirectional gated recurrent neural network (BiGRNN), and attention-free encoder–decoder (AFED) models are trained under defined hyperparameters. Experimental results show that the attention-free encoder-decoder model achieves an accuracy, precision, recall, and F-score of 0.96, 0.95, 0.95, and 0.95, respectively, and outperforms existing models.

Suggested Citation

  • Rabab Hafeez & Muhammad Waqas Anwar & Muhammad Hasan Jamal & Tayyaba Fatima & Julio César Martínez Espinosa & Luis Alonso Dzul López & Ernesto Bautista Thompson & Imran Ashraf, 2023. "Contextual Urdu Lemmatization Using Recurrent Neural Network Models," Mathematics, MDPI, vol. 11(2), pages 1-20, January.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:2:p:435-:d:1035281
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/2/435/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/2/435/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:2:p:435-:d:1035281. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.