summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/parser.c
AgeCommit message (Collapse)Author
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
2012-04-02simple cleanup in the robust parserkr.angelov
2012-03-12libpgf: a new implementation for literals which also allows custom literals. ↵kr.angelov
the same mechanism is now used for the metavariables
2012-03-09libpgf: added simple lexerkr.angelov
2012-03-07libpgf: implementation for built in literal categorieskr.angelov
2012-03-07libpgf: simple fix in the parser debuggerkr.angelov
2012-03-07libpgf: two APIs - one for finding all parse results and another for finding ↵kr.angelov
the best parse result
2012-03-05libpgf: now all concrete functions and categories are explicitly linked to ↵kr.angelov
their abstract counter parts
2012-03-02libpgf: preliminary version for the statistical ranking. we use naive ↵kr.angelov
statistical model with random weight for the meta variables.
2012-02-29libpgf: the first prototype for the robust parserkr.angelov
2012-02-28libpgf: another fix in the parser debuggerkr.angelov
2012-02-28libpgf: fix in the parser debuggerkr.angelov
2012-02-22libpgf: now we have both complete bottom up index for robust parsing and ↵kr.angelov
fast lexical lookup from the same index
2012-02-22libpgf: two small fixes in the parser debuggerkr.angelov
2012-02-21libpgf: added index for fast lexicon lookup. Still not perfectkr.angelov
2012-02-18libpgf: now the debugging mode for the parser is available only with ↵kr.angelov
compilation option.
2012-02-18libpgf: now the linearization index is created during the grammar loading ↵kr.angelov
which also makes the types PgfLzr and PgfParser redundant.
2012-01-26libpgf: switch to using callbacks and lazy prediction in the parser. this ↵kr.angelov
reduce the parsing time from 11 sec down to 3 sec.
2012-01-26libpgf: use a temporal pool for allocating the arrays in the continuation ↵kr.angelov
map of the parser
2012-01-23libpgf: debugging framework for the parserkr.angelov
2012-01-20initial import of the C runtimekr.angelov
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-23 06:45:38 +0000