Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Models for retrieval with probabilistic indexing
Information Processing and Management: an International Journal - Modeling data, information and knowledge
Passage-level evidence in document retrieval
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Passage retrieval: a probabilistic technique
Information Processing and Management: an International Journal
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Information Processing and Management: an International Journal
An automatic clustering of articles using dictionary definitions
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Hi-index | 0.00 |
Readers can know the subject of many document fields by reading only some specific Field Association (FA) words. Document fields can be decided efficiently if there are many rank 1 FA words (words that direct connect to terminal fields) and if the frequency rate is high. This paper proposes a new method for increasing rank 1 FA words using declinable words and concurrent words which relate to narrow association categories and eliminate FA word ambiguity. Concurrent words become Concurrent Field Association Words (CFA words) if there is a little field overlap. Usually, efficient CFA words are difficult to extract using only frequency, so this paper proposes weighting according to degree of importance of concurrent words. The new weighting method causes Precision and Recall to be higher than by using frequency alone. Moreover, combining CFA words with FA words allow easy search of fields which can not be searched by using only FA words.