DocumentCode :
1950542
Title :
Markov models for clusters in concordance compression
Author :
Bookstein, A. ; Klein, S.T. ; Raita, T.
Author_Institution :
Center for Inf. & Language Studies, Chicago Univ., IL, USA
fYear :
1994
fDate :
29-31 Mar 1994
Firstpage :
116
Lastpage :
125
Abstract :
An earlier paper developed a procedure for compressing concordances, assuming that all elements occurred independently. In this paper, the earlier models are extended to take the possibility of clustering into account. The authors suggest several models adapted to concordances of large full-text information retrieval systems, which are generally subject to clustering
Keywords :
Markov processes; data compression; image coding; information retrieval systems; word processing; Markov models; clustering; concordance compression; full-text information retrieval systems; Data structures; Databases; Delay; Dictionaries; Information retrieval; Pattern matching; Query processing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 1994. DCC '94. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-5637-9
Type :
conf
DOI :
10.1109/DCC.1994.305919
Filename :
305919
Link To Document :
بازگشت