This paper reports an evaluation of three methods for the expansion of natural language queries in ranked-out put retrieval systems. The methods are based on term co-oc currence data, on Soundex codes, and on a string similarity measure. Searches for 110 queries in a database of 26,280 titles and abstracts suggest that there is no significant differ ence in retrieval effectiveness between any of these methods and unexpanded searches.
Get full access to this article
View all access options for this article.
References
1.
W.B. Croft and R. Das, Expenments with query acquisttion and use in document retrieval systems, Proceedings of the 13th International Conference on Recearch and Development in Information Retriet al (1990) 349-365.
2.
W.B. Croft and D.J. Harper, Using probabilistic models of document retrieval without relevance information, Journal of Documentation35 (1979) 285-295.
3.
F.C. Ekmekcioglu , Comparative evaluation of techniques for computer-assisted query expansion in INSTRUCT (MSc dissertation, University of Sheffield, 1991)
4.
G.E. Freund and P. Willett, Online identification of word variants and arbitrary truncation searching using a string similarity measure, Information Technology. Research and Development1 (1982) 177-187
5.
D. Harman, Towards interactive query expansion. Proceedings of the 11th International Conference on Research and Development in Information Retriet al ( 1988) 321-331
6.
I.G. Hendry .P. Willett and F.E. Wood, INSTRUCT a teaching package for experimental methods in information retrieval Part I The user's view. Program20 (1986) 245-263.
7.
I.G. Hendry , P. Willett and F.E. Wood.INSTRUCT: a teaching package for experimental methods in information retrieval. Part II. Computational aspects, Program20 (1986) 382-393.
8.
A. Jacquesson and W.D. Scheber.Term association analysis on a large file of bibliographic data, using a highly-controlled indexing vocabulary , Information Storage and Retriet al9 (1973) 85-94.
9.
M.E. Lesk , Word-word associations in document retrieval systems. American Documentation20 (1969) 27-38
10.
J. Minker , G.A. Wilson and B.H. Zimmerman, An evaluation of query expansion by the addition of clustered terms for a document retrieval system. Information Storage and Retrieval8 ( 1972) 329-348.
11.
H.J. Peat and P. Willett, The limitations of term co-occurrence data for query expansion in document retrieval systems. Journal of the American Society for Information Science42 (1991) 378-383.
12.
M.F. Porter .An algorithm for suffix stripping, Program14 (1980) 130-137.
13.
S.E. Robertson , On term selection for query expansion, Journal of Documentation46 (1990 ) 359-304.
14.
G Salton, and C. Buckley, Improving retneval performance by relevance feedback, Journal of the American Society for Information Science41 (1990) 288-297.
15.
S. Siegal and N.J. Castellan, Nonparametric Statistics for the Behavioral Sciences, 2nd ed. (McGraw-Hill, New York. 1988).
16.
A.F. Smeaton and C.J. van Rysbergen.The retrieval effects of query expansion on a feedback document retrieval system. Computer Journal26 (1983) 239-246.
17.
K. Sparck Jones .Automatic Kevword Classification for Information Retriet al (Butterworth. London , 1971).
18.
S.J. Wade and P. Willett.INSTRUCT: a teaching package for experimental methods in information retrieval. Part III. Browsing, clustering and query expansion, Program22 (1988) 44-61.
19.
S. Walker and R.M. Jones.Improving Subject Retriet al in Onlme Catalogues (British Library Research and Development Department. London, 1987).
