summaryrefslogtreecommitdiff
path: root/src/runtime/c
AgeCommit message (Collapse)Author
2013-06-26an optimization in the jitter for generating more compact codekr.angelov
2013-06-26patch for adjustable heuristics from Pythonkr.angelov
2013-06-26compatibility issue for MacOS Xkr.angelov
2013-06-26fix for x86_64kr.angelov
2013-06-25Now there is a just-in-time compiler which generates native code for proof ↵kr.angelov
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
2013-06-24bugfix for the linearizer in the C runtimekr.angelov
2013-06-22bugfix for the word completion in the C runtimekr.angelov
2013-06-20add x86_64 support to GNU lightningkr.angelov
2013-06-17fix for a couple of warnings that are generated when GNU lightning is usedkr.angelov
2013-06-17add the source code for GNU lightning in the source directory for the C runtimekr.angelov
2013-05-30bugfix for the grammar printer in the C runtimekr.angelov
2013-05-29readPGF in the Python runtime now throws "No such file or directory" ↵kr.angelov
exception if the grammar is missing
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-22bug fix in pgf-translate which was hiding that there are more than one trees ↵kr.angelov
per sentence
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-05now the web service to the robust parser can to translations alsokr.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-14update the pgf-service tool from the C runtime after the changes in the APIkr.angelov
2013-03-11bugfix in the statistical parserkr.angelov
2013-02-26added gu_buf_flush in seq.c which removes all elements from a bufferkr.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-02-01implement gu_exn_caught in gu/exn.c. It was missingkr.angelov
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-08fix warnings in pgf-parse.ckr.angelov
2013-01-08PGF installation instructions for Mac OSXpeter.ljunglof
2013-01-08Made meta probs an optional argument instead of hard-coded in pgf-translatepeter.ljunglof
2013-01-08New PGF utility: pgf-parsepeter.ljunglof
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
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 21:44:28 +0000