Gonnet, G.H.; Snider, T.; Baeza-Yates, R.A.: New indices for text : PAT trees and PAT arrays (1992)
0.00
0.0019187195 = product of:
0.003837439 = sum of:
0.003837439 = product of:
0.007674878 = sum of:
0.007674878 = weight(_text_:a in 3500) [ClassicSimilarity], result of:
0.007674878 = score(doc=3500,freq=6.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.17652355 = fieldWeight in 3500, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=3500)
0.5 = coord(1/2)
0.5 = coord(1/2)
- 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
- Type
- a