| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
entry. Now this is fixed by treating those as syntactic rules
|
|
|
|
if case_sensitive=off
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if their probability differ with less that 0.5
|
|
|
|
would gladly remove some code.
|
|
|
|
The API in the C runtime as well as in the Haskell, Python and Java binding
is changed. Now instead of adding the literal callbacks to the concrete syntax
you need to supply them every time when you need to parse. The main reason is:
- referentially transparent API for Haskell
- when we start using memory mapped files we will not be allowed to change
anything in the grammar data structures. At that point the old API would
be impossible to use.
|
|
|
|
|
|
|
|
BIND token which means that the App grammar was running about 2-3 times slower.
|
|
|
|
Haskell runtime but will be intepreted in the C runtime
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
prediction
|
|
|
|
|
|
|
|
|
|
some sentences
|
|
between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word.
|
|
loading. The parser still seems to be 8 times slower than before I introduced the BIND. At least the Android UI now feels a lot more comfortable
|
|
|
|
later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf
|
|
|
|
|
|
|
|
|
|
|
|
|
