summaryrefslogtreecommitdiff
path: root/src/runtime
AgeCommit message (Collapse)Author
2013-03-26haddock bug workaroundhallgren
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-03-09ghc-7.6: add missing Num instance for BitsSergei Trofimovich
Fixes the following build failure: src/runtime/haskell/Data/Binary/IEEE754.lhs:256:17: Could not deduce (Num a) arising from a use of `mask' from the context (Bits a) bound by the type signature for clamp :: Bits a => BitCount -> a -> a
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-13Fix for a PGF portability problemhallgren
GF produced slightly different PGF files on 64-bit systems and 32-bit systems. This could cause problems when a PGF was produced on a 32-bit system and used on a 64-bit system. To fix this, the GF compiler and the Haskell PGF run-time library now reads and writes PGF files like the 32-bit version even when compiled on a 64-bit system. Note: the Haskell type Int is still used internally in GF, which could be 32 bits or 64 bits...
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-29Avoid crash in random generation with probabilitieshallgren
2013-01-29bugfix in the reference counting for Pythonkr.angelov
2013-01-29the Python binding is in pure C againkr.angelov
2013-01-29added an API for composing and decomposing abstract trees from Pythonkr.angelov
2013-01-29fixed typos in the python binding: in a few places pgf_ExprType was used ↵kr.angelov
instead of pgf_ExprIterType
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-07now the Python binding has an alternative representation for abstract trees ↵kr.angelov
which is composed of Python objects. The new representation is not integrated with the core runtime yet
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-27bugfix in the strings library from the C runtimekr.angelov
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-18fixed accidental bug in pgf-parse.ckr.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-14a bit more flexible API for parsing in Pythonkr.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-13added simple error handling in the Python testkr.angelov
2012-12-13added a simple test for the Python bindingkr.angelov
2012-12-13an initial API for parsing and linearization from Pythonkr.angelov
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
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-22 07:49:42 +0000