Exploiting the Similarity of Non-Matching Terms at Retrieval Time |
| |
| Authors: | Fabio Crestani |
| |
| Institution: | (1) Department of Computing Science, University of Glasgow, Scotland, UK |
| |
| Abstract: | In classic Information Retrieval systems a relevant document will not be retrieved in response to a query if the document and query representations do not share at least one term. This problem, known as  term mismatch , has been recognised for a long time by the Information Retrieval community and a number of possible solutions have been proposed. Here I present a preliminary investigation into a new class of retrieval models that attempt to solve the term mismatch problem by exploiting complete or partial knowledge of term similarity in the term space. The use of term similarity enables to enhance classic retrieval models by taking into account non-matching terms. The theoretical advantages and drawbacks of these models are presented and compared with other models tackling the same problem. A preliminary experimental investigation into the performance gain achieved by exploiting term similarity with the proposed models is presented and discussed. |
| |
| Keywords: | information retrieval term mismatch problem term similarity retrieval model |
| 本文献已被 SpringerLink 等数据库收录！ |
