Complete statistical indexing of text by overlapping word fragments

Authors:
Clinton P. Mah;Raymond J. D'Amore
Affiliations:
PAR Technology Corporation, New Hartford, NY;PAR Technology Corporation, New Hartford, NY
Venue:
ACM SIGIR Forum
Year:
1983

Citing 0
Cited 6

Reflections on NoteCards: seven issues for the next generation of hypermedia systems

Communications of the ACM
One-time complete indexing of text: theory and practice

SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Experiments with cited titles for automatic document indexing and similarity measure in a probabilistic context

SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Reflections on NoteCards: seven issues for the next generation of hypermedia systems

ACM Journal of Computer Documentation (JCD)
Character N-Gram Tokenization for European Language Text Retrieval

Information Retrieval
TinyLex: static n-gram index pruning with perfect recall

Proceedings of the 17th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.02

Visualization

Abstract

By using overlapping word fragments to index text, we can combine the best features of the keyword and the full text approaches to document retrieval so as to facilitate searches on any content word. The characteristics of a retrieval system based on word fragment indexing can be precisely predicted from a multinomial model of text. Controlled experiments with two different text collections indicate that such a system can be highly effective under quite general conditions.