summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/parser.c
AgeCommit message (Collapse)Author
2013-09-04remove the dependency on the HAVE_STATEMENT_EXPRESSIONS flag. This reduces ↵kr.angelov
the dependency on the ./configure script
2013-08-23nonExist now does the expected thingkr.angelov
2013-08-21fix in the C parserkr.angelov
2013-08-19word completion in the C runtime now returns multi-word expressions and the ↵kr.angelov
category for every expression
2013-08-19fullFormLexicon in C and Pythonkr.angelov
2013-08-16implemented lookupMorpho for C and Pythonkr.angelov
2013-07-03the parser in the C runtime now checks for duplicated resultskr.angelov
2013-06-27C runtime: fix the debug modes in the parser and in the reasoner after the ↵kr.angelov
changes in the printer
2013-06-26patch for adjustable heuristics from Pythonkr.angelov
2013-05-07bug fix in the management of memory pools in the statistical parserkr.angelov
2013-05-06the 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-05fix the leftcorner filtering after the addition of word completionkr.angelov
2013-05-01word completion in the C runtime. The runtime/python/test.py example is now ↵kr.angelov
using readline with word completion
2013-04-26finally the statistical parser is able to return all possible abstract treeskr.angelov
2013-03-20the 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-20replace #if with #ifdef when checking for the optional bottom up filtering ↵kr.angelov
in the C runtime
2013-03-19the 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-11bugfix in the statistical parserkr.angelov
2013-02-19the parser in the C runtime should not crash if the start category is not ↵kr.angelov
defined
2013-02-12now the beam size for the statistical parser can be configured by using the ↵kr.angelov
flag beam_size in the top-level concrete module
2013-02-12the statistical parser now uses a baseline lexical estimation of the beam sizekr.angelov
2013-02-11remove the pgf2yaml tool which was both broken and redundant. The ↵kr.angelov
declarations for generic programming from data.c are removed as well
2012-12-19bugfix for linearization of metavariables at the root of a treekr.angelov
2012-12-19a major reimplementation of the linearizer in the C runtimekr.angelov
2012-12-13bugfix: the outside probability of a PgfItemConts must always be initialized ↵kr.angelov
to zero
2012-12-11bugfix for robust parsing with multi-word unitskr.angelov
2012-12-03added experimental script for chunking in the C runtimekr.angelov
2012-11-19remove the duplicated definition of PgfProductionIdx in parser.ckr.angelov
2012-11-16bugfix for the building of bottom-up filter in the C runtimekr.angelov
2012-11-14revised heuristic in the statistical parserkr.angelov
2012-11-13bugfix in the statistical parserkr.angelov
2012-11-12two simple heuristics which speed up the statistical parser more than seven ↵kr.angelov
times.
2012-11-12a simple refactoring in the statistical parserkr.angelov
2012-11-12more counters in the profiler for the statistical parserkr.angelov
2012-11-12now we store the state instead of the offset for every continuation in the ↵kr.angelov
chart for the statistical parser
2012-11-12in the statistical parser: move the outside probability from the parse items ↵kr.angelov
to their continuation. this makes the value slot shared between many items
2012-11-12small refactoring in the C runtimekr.angelov
2012-11-12use size_t consistently as the type for constituent indices in the C runtimekr.angelov
2012-10-25forgot to add one #ifdefkr.angelov
2012-10-25a major refactoring in the robust parser: bottom-up filtering and garbage ↵kr.angelov
collection for the chart
2012-09-24in the robust parser we don't have to care about trees which yeld empty ↵kr.angelov
strings. this makes the parser a lot faster
2012-09-18the C runtime now has a type prob_t which is used only for probability valueskr.angelov
2012-09-06bugfix in the C parserkr.angelov
2012-06-13Use a separated tag for meta productions in the robust parser. This cleans ↵kr.angelov
up the code a lot
2012-06-12now 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-12now the robust parser is purely top-down and the meta rules compete on a ↵kr.angelov
fair basis with the grammar rules
2012-05-25the viterbi probability for the epsilon categories is now updated properlykr.angelov
2012-05-16another attempt to port the robust parser to MacOSkr.angelov
2012-05-08a new unbiased statistical parser. it is still far from perfect use it on ↵kr.angelov
your own risk.
2012-04-12some fixes in the robust parser and a new API for literalskr.angelov