9 Commits

Author	SHA1	Message	Date
kr.angelov	8aefd1e072	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-14 15:32:49 +00:00
kr.angelov	2ba632dc9f	a top-level API for parsing in the C runtime	2012-12-13 14:44:33 +00:00
kr.angelov	1376df457d	started an official API to the C runtime	2012-12-12 11:25:58 +00:00
kr.angelov	9721833680	a major refactoring in the robust parser: bottom-up filtering and garbage collection for the chart	2012-10-25 14:42:53 +00:00
kr.angelov	7549a4876d	now there is a limit of 2000000 items in the chart of the robust parser. This prevents from explosion in the memory size but it will also prevent us from parsing some sentences.	2012-06-12 11:30:01 +00:00
kr.angelov	b765b0c054	now the robust parser is purely top-down and the meta rules compete on a fair basis with the grammar rules	2012-06-12 09:29:51 +00:00
kr.angelov	bd8046f23d	another attempt to port the robust parser to MacOS	2012-05-16 15:18:44 +00:00
kr.angelov	64a00dad48	added an API for printing the PGF to human readable format	2012-01-21 10:27:55 +00:00
kr.angelov	a369d3bdac	initial import of the C runtime	2012-01-20 13:41:10 +00:00