An evaluation of some conflation algorithms for information retrieval
- 1 August 1981
- journal article
- research article
- Published by SAGE Publications in Journal of Information Science
- Vol. 3 (4) , 177-183
- https://doi.org/10.1177/016555158100300403
Abstract
The characteristics of conflation algorithms are discussed and examples given of some algorithms which have been used for information retrieval systems. Comparative experiments with a range of keyword dictionaries and with the Cranfield document test collection suggest that there is relatively little difference in the performance of the algorithms despite the widely disparate means by which they have been developed and by which they operate.Keywords
This publication has 14 references indexed in Scilit:
- An algorithm for suffix strippingProgram: electronic library and information systems, 1980
- Developments in word processing systems and their application to information needsAslib Proceedings, 1980
- Report of a study of the potential users and application areas for free text information storage and retrieval systems in Britain, 1979–81Program: electronic library and information systems, 1980
- Compression of Wiswesser Line Notations Using Variety GenerationJournal of Chemical Information and Computer Sciences, 1979
- DOCUMENT RETRIEVAL EXPERIMENTS USING INDEXING VOCABULARIES OF VARYING SIZE. II. HASHING, TRUNCATION, DIGRAM AND TRIGRAM ENCODING OF INDEX TERMSJournal of Documentation, 1979
- Word segmentation by letter successor varietiesInformation Storage and Retrieval, 1974
- Project intrex: A general reviewInformation Storage and Retrieval, 1974
- Document retrieval experiments using cluster analysisJournal of the American Society for Information Science, 1973
- On the Structure of Written English WordsLanguage, 1964
- A Study of Methods for Systematically Abbreviating English Words and NamesJournal of the ACM, 1961