gf-core.git - Unnamed repository; edit this file 'description' to name the repository.

Age	Commit message (Collapse)	Author
2013-09-05	remove the read and write modules from libgu. this simplifies the i/o layer	kr.angelov

2013-08-19	fullFormLexicon in C and Python	kr.angelov

2013-08-16	implemented lookupMorpho for C and Python	kr.angelov

2013-08-16	provide API to access the language code for the concrete language	kr.angelov

2013-08-16	fixes in the C and Python API to make them closer to the Haskell API	kr.angelov

2013-06-27	a complete Python API for reading, printing and manipulation of abstract ↵	kr.angelov
	trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
2013-06-26	patch for adjustable heuristics from Python	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-01	word completion in the C runtime. The runtime/python/test.py example is now ↵	kr.angelov
	using readline with word completion
2013-04-19	the C runtime and the Python binding now have an API for parser evaluation. ↵	kr.angelov
	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
2013-02-11	the class PgfConcr from the Python binding now has a property name which ↵	kr.angelov
	returns the name of the concrete syntax
2013-02-11	remove the pgf2yaml tool which was both broken and redundant. The ↵	kr.angelov
	declarations for generic programming from data.c are removed as well
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