| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2014-03-07 | added pgf_lookup_word_prefix which makes it possible to do simple word ↵ | kr.angelov | |
| prediction | |||
| 2013-12-10 | loading and unloading of languages in the C runtime and in the Python bindings | kr.angelov | |
| 2013-11-22 | bugfix in the debug mode for the parser | kr.angelov | |
| 2013-11-21 | bugfix in the C runtime | kr.angelov | |
| 2013-11-18 | bugfix in the robust parser | kr.angelov | |
| 2013-11-13 | bugfix in the C runtime which had made the parser up to 200 times slower for ↵ | kr.angelov | |
| some sentences | |||
| 2013-11-12 | added Predef.SOFT_BIND. This special token allows zero or more spaces ↵ | kr.angelov | |
| between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word. | |||
| 2013-11-07 | factor of 3 speedup for the translation without slowing down the grammar ↵ | kr.angelov | |
| 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 | |||
| 2013-11-06 | fix in the parsing with pre | kr.angelov | |
| 2013-11-06 | the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The ↵ | kr.angelov | |
| 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 | |||
| 2013-11-01 | fix the robust parser for unknown tokens | kr.angelov | |
| 2013-10-30 | use linref in the C linearizer. The robust linearization is now fully supported | kr.angelov | |
| 2013-10-30 | added the linref construction in GF. The PGF version number is now bumped | kr.angelov | |
| 2013-10-28 | another fix for 'pre' | kr.angelov | |
| 2013-10-28 | fix the handling of 'pre' in the C runtime | kr.angelov | |
| 2013-10-21 | bugfix for the custom literals in the C runtime | kr.angelov | |
| 2013-10-09 | avoid warning in parser.c when debugging is OFF | kr.angelov | |
| 2013-10-09 | a major redesign in the C runtime. The parser and the linearizer now fully ↵ | kr.angelov | |
| support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode | |||
| 2013-10-08 | fix the robust parser after the change of GuString | kr.angelov | |
| 2013-10-04 | GuString is now an ordinary C string - it makes live easier. In addition ↵ | kr.angelov | |
| PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use. | |||
| 2013-09-30 | better handling for nonExist in the C runtime. BIND is also supported in the ↵ | kr.angelov | |
| linearizer but not in the parser yet | |||
| 2013-09-27 | a major refactoring in the C and the Haskell runtimes. Note incompatible ↵ | kr.angelov | |
| change in the PGF format!!! The following are the outcomes: - Predef.nonExist is fully supported by both the Haskell and the C runtimes - Predef.BIND is now an internal compiler defined token. For now it behaves just as usual for the Haskell runtime, i.e. it generates &+. However, the special treatment will let us to handle it properly in the C runtime. - This required a major change in the PGF format since both nonExist and BIND may appear inside 'pre' and this was not supported before. | |||
| 2013-09-25 | fix the debug mode of the parser after the refactoring in libgu | kr.angelov | |
| 2013-09-17 | a major refactoring in the C runtime. GuList is now removed and replaced ↵ | kr.angelov | |
| with GuSeq. The GuSeq/GuBuf API is simplified | |||
| 2013-09-13 | remove leftcorner_cat_idx which is now redundant | kr.angelov | |
| 2013-09-13 | minor optimization/refactoring in the grammar reader | kr.angelov | |
| 2013-09-13 | the leftcorner indexing is now completely removed since it slowed down the ↵ | kr.angelov | |
| loading without speeding up parsing a lot | |||
| 2013-09-13 | fix the debug mode of the parser after the changes in the libgu API | kr.angelov | |
| 2013-09-12 | remove the logging from libgu | kr.angelov | |
| 2013-09-05 | remove the read and write modules from libgu. this simplifies the i/o layer | kr.angelov | |
| 2013-09-04 | remove the dependency on the HAVE_STATEMENT_EXPRESSIONS flag. This reduces ↵ | kr.angelov | |
| the dependency on the ./configure script | |||
| 2013-08-23 | nonExist now does the expected thing | kr.angelov | |
| 2013-08-21 | fix in the C parser | kr.angelov | |
| 2013-08-19 | word completion in the C runtime now returns multi-word expressions and the ↵ | kr.angelov | |
| category for every expression | |||
| 2013-08-19 | fullFormLexicon in C and Python | kr.angelov | |
| 2013-08-16 | implemented lookupMorpho for C and Python | kr.angelov | |
| 2013-07-03 | the parser in the C runtime now checks for duplicated results | kr.angelov | |
| 2013-06-27 | C runtime: fix the debug modes in the parser and in the reasoner after the ↵ | kr.angelov | |
| changes in the printer | |||
| 2013-06-26 | patch for adjustable heuristics from Python | kr.angelov | |
| 2013-05-07 | bug fix in the management of memory pools in the statistical parser | kr.angelov | |
| 2013-05-06 | the statistical parser is now using two memory pools: one for parsing and ↵ | kr.angelov | |
| 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 | |||
| 2013-05-05 | fix the leftcorner filtering after the addition of word completion | kr.angelov | |
| 2013-05-01 | word completion in the C runtime. The runtime/python/test.py example is now ↵ | kr.angelov | |
| using readline with word completion | |||
| 2013-04-26 | finally the statistical parser is able to return all possible abstract trees | kr.angelov | |
| 2013-03-20 | the calculation of lexical_prob in the statistical parser doesn't work ↵ | kr.angelov | |
| properly. It should be fixed but for now I just disabled the optimization | |||
| 2013-03-20 | replace #if with #ifdef when checking for the optional bottom up filtering ↵ | kr.angelov | |
| in the C runtime | |||
| 2013-03-19 | the bottom up filtering in the C runtime is temporary disabled. It takes too ↵ | kr.angelov | |
| much memory and even makes it impossible to load the Finnish and the German parsing grammars. | |||
| 2013-03-11 | bugfix in the statistical parser | kr.angelov | |
| 2013-02-19 | the parser in the C runtime should not crash if the start category is not ↵ | kr.angelov | |
| defined | |||
| 2013-02-12 | now the beam size for the statistical parser can be configured by using the ↵ | kr.angelov | |
| flag beam_size in the top-level concrete module | |||
