| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-02-01 | This patch removes Gregoire's parse_tokens function in the python binding ↵ | kr.angelov | |
| 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 | |||
| 2013-01-24 | Python binding: add a parsing function that accepts directly a list of tokens. | gregoire.detrez | |
| Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.) | |||
| 2012-12-14 | The first prototype for exhaustive generation in the C runtime. The trees ↵ | kr.angelov | |
| are always listed in decreasing probability order. There is also an API for generation from Python | |||
| 2012-12-13 | a top-level API for parsing in the C runtime | kr.angelov | |
| 2012-12-12 | started an official API to the C runtime | kr.angelov | |
| 2012-10-25 | a major refactoring in the robust parser: bottom-up filtering and garbage ↵ | kr.angelov | |
| collection for the chart | |||
| 2012-06-12 | now there is a limit of 2000000 items in the chart of the robust parser. ↵ | kr.angelov | |
| This prevents from explosion in the memory size but it will also prevent us from parsing some sentences. | |||
| 2012-06-12 | now the robust parser is purely top-down and the meta rules compete on a ↵ | kr.angelov | |
| fair basis with the grammar rules | |||
| 2012-05-16 | another attempt to port the robust parser to MacOS | kr.angelov | |
| 2012-01-21 | added an API for printing the PGF to human readable format | kr.angelov | |
| 2012-01-20 | initial import of the C runtime | kr.angelov | |
