babble

babble,ngram-method

The babbler uses its own internal PRNG (i.e., not R's), so seeds cannot be
managed as with R's seeds. The generator is an implementation of MT19937.
At this time, we note that the seed may not guarantee the same results
across machines. Currently only Solaris produces different values from
mainstream platforms (Windows, Mac, Linux, FreeBSD), but potentially others
could as well.

Amusement

An n-gram is a sequence of n "words" taken, in order, from a
body of text.  This is a collection of utilities for creating,
displaying, summarizing, and "babbling" n-grams.  The
'tokenization' and "babbling" are handled by very efficient C
code, which can even be built as its own standalone library.
The babbler is a simple Markov chain.  The package also offers
a vignette with complete example 'workflows' and information about
the utilities offered in the package.

Drew Schmidt

ngram

Fast n-Gram 'Tokenization'

Christian Heckendorf

babble function

<dl><dt>ng</dt>
<dd>An ngram object.</dd>
<dt>genlen</dt>
<dd>Generated length, i.e., the number of words to babble.</dd>
<dt>seed</dt>
<dd>Seed for the random number generator.</dd></dl>

Arguments

ngram Babbler — babble

<dl>

<dt>ng</dt>
<dd>An ngram object.</dd>


<dt>genlen</dt>
<dd>Generated length, i.e., the number of words to babble.</dd>


<dt>seed</dt>
<dd>Seed for the random number generator.</dd>

</dl>

babble: ngram Babbler

Description

Usage

Arguments

Details

See Also

Examples