Shreya Agarwal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shreya Agarwal has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ali Abbas
Department of Electronics and Communication, University of Allahabad, Prayagraj, India
7 shared publications - Prajna Jha
Department of Electronics and Communication, University of Allahabad, Prayagraj, India
7 shared publications - Tanveer Jahan Siddiqui
Department of Electronics and Communication, University of Allahabad, Prayagraj, India
7 shared publications - Manish Jaiswal
University of Allahabad
1 shared publication - Manish Jaiswal
University of Allahabad
1 shared publication - Satyendr Singh
BML Munjal University
1 shared publication
Latest Publications
- 31 October 2026
- Published by Springer Nature in Language Resources and Evaluation
- Vol. 60 (4) , 82
Harnessing rule-based and machine learning classifier for Hindi Pronominal anaphora resolution
- 31 October 2026
- Published by Springer Nature in Language Resources and Evaluation
- Vol. 60 (4) , 82
Harnessing rule-based and machine learning classifier for Hindi Pronominal anaphora resolution
- 28 July 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (6) , 1-18
Harnessing AI for Health and Knowledge: An Investigation into Machine and Deep Learning Models for Medical and Textual Data
- 28 July 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (6) , 1-18
Harnessing AI for Health and Knowledge: An Investigation into Machine and Deep Learning Models for Medical and Textual Data
- 3 March 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (3) , 1-14
A Hybrid Stacked Ensemble Model for Resolving Pronominal Anaphoric Ambiguity in Hindi Discourse
- 3 March 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (3) , 1-14
A Hybrid Stacked Ensemble Model for Resolving Pronominal Anaphoric Ambiguity in Hindi Discourse
- Open Access
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 13 (4) , 4957-4964
Unsupervised hindi word sense disambiguation using graph based centrality measures
The task of word sense disambiguation (WSD) plays a key role in multiple applications of natural language processing. In this paper, we propose a novel unsupervised method for targeted Hindi WSD task. First, we create a weighted graph where the nodes correspond to various synsets of the target word and the neighboring context words. The edges in the graph represent the semantic relations between these synsets in the Hindi WordNet hierarchy. A path-based similarity measure, namely Leacock-Chodorow similarity measure, is used to assign weights to edges. An unsupervised weighted graph-based centrality algorithm is used to identify the correct sense of a target word in a given context. The performance of the proposed algorithm is measured on 20 ambiguous Hindi nouns using four different graph-based centrality measures. We observed a maximum accuracy of 66.92% using PageRank centrality measure which is significantly better than earlier reported graph-based Hindi WSD algorithmsevaluated on the same dataset.
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in IAES International Journal of Artificial Intelligence (IJ-AI)
- Vol. 13 (4) , 4957-4964
Open AccessUnsupervised hindi word sense disambiguation using graph based centrality measures
The task of word sense disambiguation (WSD) plays a key role in multiple applications of natural language processing. In this paper, we propose a novel unsupervised method for targeted Hindi WSD task. First, we create a weighted graph where the nodes correspond to various synsets of the target word and the neighboring context words. The edges in the graph represent the semantic relations between these synsets in the Hindi WordNet hierarchy. A path-based similarity measure, namely Leacock-Chodorow similarity measure, is used to assign weights to edges. An unsupervised weighted graph-based centrality algorithm is used to identify the correct sense of a target word in a given context. The performance of the proposed algorithm is measured on 20 ambiguous Hindi nouns using four different graph-based centrality measures. We observed a maximum accuracy of 66.92% using PageRank centrality measure which is significantly better than earlier reported graph-based Hindi WSD algorithmsevaluated on the same dataset.
- 16 April 2024
- Published by Springer Nature
- p. 1-10
A Hybrid Framework for Implementing Modified K-Means Clustering Algorithm for Hindi Word Sense Disambiguation
- 16 April 2024
- Published by Springer Nature
- p. 1-10
A Hybrid Framework for Implementing Modified K-Means Clustering Algorithm for Hindi Word Sense Disambiguation
- 3 January 2024
- Published by Springer Nature
- p. 295-310
Performance Based Comparative Analysis of Naïve Bayes Variants for Text Classification
- 3 January 2024
- Published by Springer Nature
- p. 295-310
Performance Based Comparative Analysis of Naïve Bayes Variants for Text Classification
- Top Cited Papers
- 2 September 2023
- Published by Springer Nature in SN Computer Science
- Vol. 4 (5) , 1-10
A Novel Unsupervısed Graph-Based Algorıthm for Hindi Word Sense Disambiguation
- 2 September 2023
- Published by Springer Nature in SN Computer Science
- Vol. 4 (5) , 1-10
Top Cited PapersA Novel Unsupervısed Graph-Based Algorıthm for Hindi Word Sense Disambiguation