Lightweight Document Matching for Help Desk Applications (1999)
| Citations: | 5 - 3 self |
BibTeX
@MISC{Weiss99lightweightdocument,
author = {Sholom Weiss and Brian White and Chid Apte and Fred Damerau and Sholom M. Weiss and Brian F. White and V. Apte and Fredrick J. Damerau},
title = {Lightweight Document Matching for Help Desk Applications},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a fast documentmatcher that matches new documents to those stored in a database. The matcher lists in order those stored documents that are most similar to the new document. The new documents are typically detailed problem descriptions or free form textual queries of unlimited length, and the stored documents are potential answers suchasfrequently asked questions or service tips. The method uses minimal data structures and lightweight scoring algorithms to compute efficiently even in restricted environments, such as mobile or small desktop computers. Evaluations on benchmark document collections demonstrate that predictive performance for multiple document matches is competitive with more computationally expensive procedures. Keywords Text mining, Information Retrieval, Text Categorization, Case-Based Reasoning 1 1 Introduction In an age of distributed and pervasive computing, many future programs will run on smaller capacitymachines requiring "lightweight" ...
