Gonnet, G.H.; Snider, T.; Baeza-Yates, R.A.: New indices for text : PAT trees and PAT arrays (1992)
0.00
0.00447703 = product of:
0.03133921 = sum of:
0.03133921 = weight(_text_:based in 3500) [ClassicSimilarity], result of:
0.03133921 = score(doc=3500,freq=2.0), product of:
0.11767787 = queryWeight, product of:
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.03905679 = queryNorm
0.26631355 = fieldWeight in 3500, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0129938 = idf(docFreq=5906, maxDocs=44218)
0.0625 = fieldNorm(doc=3500)
0.14285715 = coord(1/7)
- Abstract
- We survey new indices for text, with emphasis on PAT arrays (also called suffic arrays). A PAT array is an index based on a new model of text that does not use the concept of word and does not need to know the structure of text
