Query expansion using heterogeneous thesauri

Mandala, Rila; Tokunaga, Takenobu; Hozumi, Takeshi

doi:10.1016/s0306-4573(99)00068-0

Cited by 50 publications

(24 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [9] is reported that the improvement in expansion increases when adding up to 20 terms, and reaches a plateau, then the improvement begins to decrease when more than 50 terms are added. The expanded queries, however, still perform better than the original queries.…”

Section: Related Workmentioning

confidence: 99%

Query Expansion of Zero-Hit Subject Searches: Using a Thesaurus in Conjunction with NLP Techniques

Kapidakis

Mastora

Peponakis

2012

Theory and Practice of Digital Libraries

View full text Add to dashboard Cite

Abstract. The focus of our study is zero-hit queries in keyword subject searches and the effort of increasing recall in these cases by reformulating and, then, expanding the initial queries using an external source of knowledge, namely a thesaurus. To this end, the objectives of this study are twofold. First, we perform the mapping of query terms to the thesaurus terms. Second, we use the matched terms to expand the user's initial query by taking advantage of the thesaurus relations and implementing natural language processing (NLP) techniques. We report on the overall procedure and elaborate on key points and considerations of each step of the process.Keywords: Query expansion, Thesaurus, Zero-hit queries, NLP techniques IntroductionThe focus of our study is zero-hit queries in keyword subject searches in an effort to increase recall by reformulating and, then, expanding the initial queries using an external source of knowledge, namely a thesaurus, and taking advantage of natural language processing (NLP) techniques. In case of zero-hit queries query expansion methods based on sets of retrieved results (implicit relevance feedback) cannot be implemented. Building on this fact, we chose to use a handmade thesaurus to expand the initial queries taking advantage of the relations identified within a thesaurus' structure without letting the users interfere in the process. In order to proceed to query expansion we first allocate an entry point within the knowledge base, i.e. match the initial queries to a term from the thesaurus. Exact string matching is unlikely to be successful in highly inflectional languages, like Greek, because of the various forms a word can take. Additionally, research has shown that typing errors are also responsible of delivering zero-hit queries [1]. To overcome the identified obstacles we used techniques for natural language processing, namely spelling, lemmatizing, removal of stop words, accent and case processing. The database and the thesaurus underwent the same processing where needed. Finally, we derived candidate expansion terms by considering the related, parallel, narrower and broader terms of the allocated entry point in the thesaurus moving one level towards each direction.The remaining sections elaborate on the overall procedure and report on key points and considerations of each step of the process.

show abstract

Section: Related Workmentioning

confidence: 99%

Query Expansion of Zero-Hit Subject Searches: Using a Thesaurus in Conjunction with NLP Techniques

Kapidakis

Mastora

Peponakis

2012

Theory and Practice of Digital Libraries

View full text Add to dashboard Cite

show abstract

“…On parle alors d'extension de la requête, ou query expansion (Efthimiadis, 1996). Les résultats des travaux sur le sujet font état de l'efficacité de cette technique pour améliorer la recherche (Mandala et al, 2000a;Pizzato, 2003;Zhang et al, 2004;Chu et al, 2005). Plus précisément, J.…”

Section: Recherche D'information Ou De Documentsunclassified

Thésaurus et systèmes de traitement automatique de la langue

Sylva

2015

documentation

View full text Add to dashboard Cite

Cet article expose le rôle que le thésaurus documentaire classique est appelé à jouer dans certains systèmes de traitement automatique de la langue. Ce type de ressource lexicale est très prisé par le domaine du traitement automatique de la langue, puisqu’il permet d’appréhender, au moins en partie, la sémantique des documents. Cette capacité peut être mise à contribution dans un grand nombre d’applications différentes. Sont présentés les thésaurus les plus utilisés pour le traitement automatique, suivis des exigences particulières qui s’appliquent aux thésaurus pour le traitement automatique. Enfin, sont brièvement abordés les efforts de construction automatique de thésaurus.The role of the classic thesaurus in certain systems of automatic language processing is the central theme of this article. This type of lexical resource is important in the field of automatic language processing because considers the semantics of documents. This capacity can become an asset with a wide range of applications. The thesauri used for automatic processing and their requirements are described. Finally, the projects to automatically construct thesauri are briefly discussed.Este artículo expone el papel que el tesauro documental clásico está llamado a desempeñar en algunos sistemas de tratamiento automático de la lengua. Este tipo de recurso léxico es muy apreciado por el campo del tratamiento automático de la lengua, porque permite comprender, al menos en parte, la semántica de los documentos. Esta capacidad puede ser aprovechada por numerosas aplicaciones diferentes. Se presentan los tesauros más utilizados para el tratamiento automático, seguidos de las exigencias particulares que se aplican a estos tesauros. Finalmente se aborda de manera breve los esfuerzos de construcción automática de tesauros

show abstract

“…Although this graph is huge, the computation of the similarity measure for a pair of words (or of a set of words) is computationally similar to the approaches in 5,11 for most situations. Note that in these latter cases, all paths between the words considered should be detected.…”

Section: Computational Issuesmentioning

confidence: 99%

“…Such functions can be either defined on purpose (by the designer of the system) or can be automatically extracted from dictionaries (as WordNet) or word corpus. 5 and GAMBAL 11 computed similarities from dictionaries. The systems using Latent Semantics Analysis 4 correspond to the second approach.…”

Section: Introductionmentioning

confidence: 99%

Word Similarity from Dictionaries: Inferring Fuzzy Measures from Fuzzy Graphs

Torra¹,

Narukawa²

2008

IJCIS

View full text Add to dashboard Cite

The computation of similarities between words is a basic element of information retrieval systems, when retrieval is not solely based on word matching. In this work we consider a measure between words based on dictionaries. This is achieved assuming that a dictionary is formalized as a fuzzy graph. We show that the approach permits to compute measures not only for pairs of words but for sets of them.

show abstract

Query expansion using heterogeneous thesauri

Cited by 50 publications

References 11 publications

Query Expansion of Zero-Hit Subject Searches: Using a Thesaurus in Conjunction with NLP Techniques

Query Expansion of Zero-Hit Subject Searches: Using a Thesaurus in Conjunction with NLP Techniques

Thésaurus et systèmes de traitement automatique de la langue

Word Similarity from Dictionaries: Inferring Fuzzy Measures from Fuzzy Graphs

Contact Info

Product

Resources

About