| | |
Methods defined here:
- KL_MC(self, p2, nb=100, lg=1000)
- Compute KL-distance with Monte Carlo at Proportion p2 on
nb=100 Sequence of length lg=1000.
- __getitem__(self, s)
- Return the string of posterior of prior s (x.__getitem__(s)
<==> x[s]).
- __iadd__(self, p)
- Add to self the Proportion p.
- __init__(self, **kw)
- Keyword arguments:
fic -- Build from filename fic;
str -- Build from string str.
- __str__(self)
- (x.__str__() <==> str(x))
- alph(self, s=[])
- has_prefix(self, s)
- Return True iff s is a STRICT prefix, else False.
- lg_max(self)
- Return the length of the longest word (prior+posterior).
- lg_max_posterior(self)
- Return the length of the longest posterior.
- lg_max_prior(self)
- Return the length of the longest prior.
- loglex(self, n=0)
- Build a new Descripteur of number n.
- next(self, s)
- Return the list of [word, value] which s in the prefix.
- rand_next(self, s)
- Return a string randomly chosen among the ones which s in
the prefix, following the proportions of this.
- read_Compte(self, com, **kw)
- Build from Compte com:
Keyword argument:
lpost -- length of the posterior words (ie on the right) (default: max);
lprior -- length of the prior words (ie on the left) (default: 0).
- read_nf(self, nf)
- Read file of name nf.
- read_str(self, st)
- Read string st, at same format as the file's.
Methods inherited from _Arbre:
- __idiv__(self, v)
- Divide each node by value v (x.__idiv(v) <==> x/= v).
|