q-gram analysis and urn models
Abstrak
Words of fixed size q are commonly referred to as $q$-grams. We consider the problem of $q$-gram filtration, a method commonly used to speed upsequence comparison. We are interested in the statistics of the number of $q$-grams common to two random texts (where multiplicities are not counted) in the non uniform Bernoulli model. In the exact and dependent model, when omitting border effects, a $q$-gramin a random sequence depends on the $q-1$ preceding $q$-grams. In an approximate and independent model, we draw randomly a $q$-gram at each position, independently of the others positions. Using ball and urn models, we analyze the independent model. Numerical simulations show that this model is an excellent first order approximationto the dependent model. We provide an algorithm to compute the moments.
Topik & Kata Kunci
Penulis (1)
Pierre Nicodème
Akses Cepat
- Tahun Terbit
- 2003
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.3322
- Akses
- Open Access ✓