gf-core.git/src/runtime/c/pgf/parser.h, branch master Unnamed repository; edit this file 'description' to name the repository. https://git.adelon.net/gf-core.git/atom?h=master 2014-11-27T11:12:14+00:00 remove pgf/parser.h 2014-11-27T11:12:14+00:00 kr.angelov kr.angelov@gmail.com 2014-11-27T11:12:14+00:00 urn:sha1:f63e8faf006cfe9dd69e0248590194b03d142fd6 now fully functional Java API for custom literals 2014-04-10T14:14:31+00:00 kr.angelov kr.angelov@gmail.com 2014-04-10T14:14:31+00:00 urn:sha1:1ca09448f9032b92ef436f4e0f658309d60e7ffd a major redesign in the C runtime. The parser and the linearizer now fully support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode 2013-10-09T12:08:51+00:00 kr.angelov kr.angelov@gmail.com 2013-10-09T12:08:51+00:00 urn:sha1:8cf03bc5b6895568eb08be1415985a64793bb81c a major refactoring in the C runtime. GuList is now removed and replaced with GuSeq. The GuSeq/GuBuf API is simplified 2013-09-17T12:45:00+00:00 kr.angelov kr.angelov@gmail.com 2013-09-17T12:45:00+00:00 urn:sha1:2a49e4e1d64ef2df0bb2a8a3822f7fa1048e687f patch for adjustable heuristics from Python 2013-06-26T07:36:03+00:00 kr.angelov kr.angelov@gmail.com 2013-06-26T07:36:03+00:00 urn:sha1:3c2d1890d0c5de25bbaa7c582c20bcd67bc47d8c bug fix in the management of memory pools in the statistical parser 2013-05-07T08:30:32+00:00 kr.angelov kr.angelov@gmail.com 2013-05-07T08:30:32+00:00 urn:sha1:687b326ed0ec67bd597c8e639e1f1e468622d26f word completion in the C runtime. The runtime/python/test.py example is now using readline with word completion 2013-05-01T06:09:55+00:00 kr.angelov kr.angelov@gmail.com 2013-05-01T06:09:55+00:00 urn:sha1:22f44ef61f99acdec5d19f336bb80f6bb3a4e8b7 finally the statistical parser is able to return all possible abstract trees 2013-04-26T20:44:01+00:00 kr.angelov kr.angelov@gmail.com 2013-04-26T20:44:01+00:00 urn:sha1:85efdf81e7542bb5d04b176671358135144963e9 the statistical parser now uses a baseline lexical estimation of the beam size 2013-02-12T09:41:32+00:00 kr.angelov kr.angelov@gmail.com 2013-02-12T09:41:32+00:00 urn:sha1:a4c9d20fc3a92dc2e80208d4fe7b4f54a64a17af The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python 2012-12-14T15:32:49+00:00 kr.angelov kr.angelov@gmail.com 2012-12-14T15:32:49+00:00 urn:sha1:20aaa4a9899ce454d3c20594a2b7d2d3d38dbc88