Markov models for clusters in concordance compression
Abraham Bookstein, Shmuel T. Klein, Timo Raita · 2002
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.>