| Age | Commit message (Collapse) | Author |
|
The API computes PARSEVAL and Exact Match for a given tree. As a side effect the abstract trees in Python are now compared for equality by value and not by reference
|
|
|
|
sentences
|
|
|
|
properly. It should be fixed but for now I just disabled the optimization
|
|
in the C runtime
|
|
much memory and even makes it impossible to load the Finnish and the German parsing grammars.
|
|
|
|
|
|
defined
|
|
|
|
|
|
flag beam_size in the top-level concrete module
|
|
|
|
returns the name of the concrete syntax
|
|
|
|
declarations for generic programming from data.c are removed as well
|
|
use the generic programming API
|
|
and adds another implementation which builds on the existing API for lexers in the C runtime. Now it is possible to write incremental Lexers in Python
|
|
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
|