summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf
AgeCommit message (Collapse)Author
2013-05-21fix the encoding problem with unicode literals in the Python bindingkr.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-04bugfix in the C runtime which was causing an infinite loop while linearizing ↵kr.angelov
partial trees
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-04-23a trivial refactoring of the reasoner in the C runtimekr.angelov
2013-04-19the 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-04-18added API for computing bracketed strings from Python and Ckr.angelov
2013-04-05a bugfix which was causing an infinite loop in the C linearizer for some ↵kr.angelov
sentences
2013-04-05a very simple linearization for partial abstract trees in the C runtimekr.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-14bug fix in the linearizer in the C runtimekr.angelov
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-19bugfix in the grammar reader in the C runtimekr.angelov
2013-02-13bugfix in the linearizer for the C runtimekr.angelov
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-11the class PgfConcr from the Python binding now has a property name which ↵kr.angelov
returns the name of the concrete syntax
2013-02-11refactoring: now all named objects in the C runtime have an explicit name fieldkr.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
2013-02-11the grammar reader in the C runtime is completely rewritten and it doesn't ↵kr.angelov
use the generic programming API
2013-02-01This 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-24Python 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.)
2013-01-07a new reasoner in the C runtime. It supports tabling which makes it ↵kr.angelov
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
2012-12-19bugfix: the linearizer should not generate extra space at the end of the ↵kr.angelov
sentence
2012-12-19bugfix for linearization of metavariables at the root of a treekr.angelov
2012-12-19rename linearize.{h/c} to linearizer.{h/c} which follows the convention used ↵kr.angelov
in parser.c and reasoner.c
2012-12-19a major reimplementation of the linearizer in the C runtimekr.angelov
2012-12-18the C runtime now can read abstract expressions with literals and meta variableskr.angelov
2012-12-14debugging infrastructure in the reasonerkr.angelov
2012-12-14bugfix for the reasoner in the C runtimekr.angelov
2012-12-14The 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-13bugfix in the lexer from the C runtime. the input sentence doesn't have to ↵kr.angelov
terminate with whitespace
2012-12-13a top-level API for parsing in the C runtimekr.angelov
2012-12-13bugfix: the outside probability of a PgfItemConts must always be initialized ↵kr.angelov
to zero
2012-12-13bugfix: pgf_read_expr no longer requires a semicolon at the end of an ↵kr.angelov
abstract expression
2012-12-12started an official API to the C runtimekr.angelov
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
generated by cgit v1.2.3 (git 2.39.1) at 2026-06-19 07:25:51 +0000