Best match / partial match
Croft (1998) defines best match retrieval as: "
query describes good or "best" matching document
result is ranked list of documents
result may include estimate of quality
Best-match models generally have better retrieval performance
good documents appear at top of ranking
hard to compare best- and exact-match in principled ways"
Literature:
Beaulieu, M. & Jones, S. (1998). Interactive searching and interface
issues in the Okapi best match probabilistic retrieval system. Interacting
with computers, 10(3), 237-248.
Can, F. (1994). On the efficiency of best-match cluster searches. Information Processing & Management, 30(3), 343-361.
Croft, B. (1998). Exact-Match Retrieval. http://www.cpe.ku.ac.th/~arnon/Mirror/ir-p/ir6/
McCall, F. M. & Willett, P. (1986). Criteria for the selection of search strategies in best-match document-retrieval systems. International Journal of Man-Machine Studies, 25(3), 317-326.
Paris, L. A. H. & Tibbo, H. R. (1998). Freestyle vs. Boolean: A comparison of partial and exact match retrieval systems. Information Processing & Management, 34(2-3), 175-190.
Perry, S. A. & Willett, P. (1983). A review of the use of inverted files for best match searching in information-retrieval systems. Journal of Information Science, 6(2-3), 59-66.
Shasha, D. & Wang, T. L. (1990). New Techniques for best-match retrieval.
ACM Transactions on Information Systems, 8(2), 140-158.
van Rijsbergen, C. J. (1974). Best-Match problem in document retrieval. Communications of the ACM, 17(11), 648-649.
Wolff, J. G.
(1994). A Scaleable technique for best-match retrieval of sequential information
using metrics-guided search. Journal of Information Science, 20(1),
16-28.
See also Exact match;
Fuzzy logic; Match
Birger Hjørland
Last edited: 14-05-2006