Name
Abstract | ||
|---|---|---|
We consider a component of the word statistics known as clump; starting from
a finite set of words, clumps are maximal overlapping sets of these
occurrences. This parameter has first been studied by Schbath with the aim of
counting the number of occurrences of words in random texts. Later work with
similar probabilistic approach used the Chen-Stein approximation for a compound
Poisson distribution, where the number of clumps follows a law close to
Poisson. Presently there is no combinatorial counterpart to this approach, and
we fill the gap here. We emphasize the fact that, in contrast with the
probabilistic approach which only provides asymptotic results, the
combinatorial approach provides exact results that are useful when considering
short sequences. |
Year | Venue | Keywords |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | automata,formal language decomposition,generating functions,words counting,information retrieval,discrete mathematics,compound poisson distribution |
Field | DocType | Volume |
Compound Poisson distribution,Discrete mathematics,Generating function,A-law algorithm,Combinatorics,Combinatorial method,Finite set,Automaton,Probabilistic logic,Poisson distribution,Statistics,Mathematics | Journal | abs/0804.3 |
Citations | PageRank | References |
3 | 0.42 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédérique Bassino | 1 | 130 | 20.38 |
| Julien Clément | 2 | 141 | 12.15 |
| Julien Fayolle | 3 | 21 | 1.84 |
| Pierre Nicodème | 4 | 104 | 14.51 |