The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Term Ordering-Based Query Expansion Technique for Hindi-English CLIR System
|
Author(s): Ganesh Chandra (Babasaheb Bhimrao Ambedkar University, Lucknow, India)and Sanjay K. Dwivedi (Babasaheb Bhimrao Ambedkar University, Lucknow, India)
Copyright: 2020
Pages: 20
Source title:
Handling Priority Inversion in Time-Constrained Distributed Databases
Source Author(s)/Editor(s): Udai Shanker (Madan Mohan Malaviya University of Technology, India)and Sarvesh Pandey (Madan Mohan Malaviya University of Technology, India)
DOI: 10.4018/978-1-7998-2491-6.ch016
Purchase
|
Abstract
The quality of retrieval documents in CLIR is often poor compared to IR system due to (1) query mismatching, (2) multiple representations of query terms, and (3) un-translated query terms. The inappropriate translation may lead to poor quality of results. Hence, automated query translation is performed using the back-translation approach for improvement of query translation. This chapter mainly focuses on query expansion (Q.E) and proposes an algorithm to address the drift query issue for Hindi-English CLIR. The system uses FIRE datasets and a set of 50 queries of Hindi language for evaluation. The purpose of a term ordering-based algorithm is to resolve the drift query issue in Q.E. The result shows that the relevancy of Hindi-English CLIR is improved by performing Q.E. using a term ordering-based algorithm. The outcome achieved 60.18% accuracy of results where Q.E has been performed using a term ordering based algorithm, whereas the result of Q.E without a term ordering-based algorithm stands at 57.46%.
Related Content
Tapan Kumar Behera.
© 2023.
20 pages.
|
B. Narendra Kumar Rao.
© 2023.
17 pages.
|
Blendi Rrustemi, Deti Baholli, Herolind Balaj.
© 2023.
18 pages.
|
Alma Beluli.
© 2023.
11 pages.
|
Jona Ndrecaj, Shkurte Berisha, Erita Çunaku.
© 2023.
15 pages.
|
Yllka Totaj.
© 2023.
12 pages.
|
Hla Myo Tun, Devasis Pradhan.
© 2023.
31 pages.
|
|
|