| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
changes in the printer
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
it is implicitly kept in the JIT compiled code
|
|
|
|
|
|
|
|
|
|
|
|
|
|
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
exception if the grammar is missing
|
|
|
|
|
|
one for the output trees. This means that the memory for parsing can be released as soon as the needed abstract trees are retrieved, while the trees themselves are retained in the separate output pool
|
|
|
|
partial trees
|
|
using readline with word completion
|
|
|
|
|
|
per sentence
|
|
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.
|
|
|
|
|
|
|
|
|