IDEAS home Printed from https://ideas.repec.org/a/gvu/tcsst0/v7y2025i4id2125.html

Evaluating Random Forest and Decision Tree Algorithms for Resolving Lexical Ambiguity in the Gujarati Language

Author

Listed:
  • Avani N Dave
  • Sanjay M Shah
  • Nakul R Dave

Abstract

Word sense disambiguation is the task of determining the exact meaning of a word based on its context. This task is crucial in natural language processing. The lack of labeled datasets and the complex structure of the language, which includes idiomatic usage and subtle semantic changes, contribute to the poor outcomes of earlier attempts to solve word sense disambiguation in Gujarati. As a result, various models have shown low accuracy. To address this issue, we have created a new dataset that is manually sense-annotated for unclear Gujarati words. The corpus contains 50 ambiguous words, and each word has been assigned to the appropriate context. This makes it a valuable starting point for evaluating supervised learning models. With this newly compiled corpus, we carry out a systematic study of two supervised machine learning algorithms-Decision Tree and Random Forest-using 3-fold and 5-fold cross-validation. Our results show that Random Forest obtains the highest accuracy, highlighting which supervised methods are best suited for this particular task. The main contributions of this work include the development of a much-needed annotated corpus and sufficient evidence to prove that supervised learning can be quite effective in improving WSD for Gujarati when proper data is integrated.

Suggested Citation

Handle: RePEc:gvu:tcsst0:v:7:y:2025:i:4:id:2125
DOI: 10.36548/jtcsst.2025.4.006
as

Download full text from publisher

File URL: https://irojournals.com/tcsst/article/view/2125
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/tcsst/article/download/2125/1937
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jtcsst.2025.4.006?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;
;

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:gvu:tcsst0:v:7:y:2025:i:4:id:2125. 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 Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .

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.