| Age | Commit message (Collapse) | Author |
|
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
|
|
|
|
|
|
|
|
|
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
|
|
|
sentence
|
|
|
|
in parser.c and reasoner.c
|
|
|
|
|
|
|
|
|
|
|
|
are always listed in decreasing probability order. There is also an API for generation from Python
|
|
terminate with whitespace
|
|
|
|
to zero
|
|
abstract expression
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
times.
|
|
|
|
|
|
chart for the statistical parser
|
|
to their continuation. this makes the value slot shared between many items
|
|
|
|
|
|
|
|
|
|
|
|
collection for the chart
|
|
|
|
|
|
statistical model instead of computed internally. this avoids rounding errors while computing the sum of a large number of small values.
|
|
strings. this makes the parser a lot faster
|
|
|
|
|
|
|
|
|
|
runtime are still not connected but the source code compiles.
|
|
up the code a lot
|