summaryrefslogtreecommitdiff
path: root/src/runtime
AgeCommit message (Collapse)Author
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
2012-12-13bugfix: pgf_read_expr no longer requires a semicolon at the end of an ↵kr.angelov
abstract expression
2012-12-12an initial Python binding to the C runtimekr.angelov
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-12-03added INSTALL file and updated README file for the C runtimekr.angelov
2012-11-22PGFService.hs: fix type error caused by change to PGF.graphvizParseTreehallgren
Note that some of the graphviz functions have backwards incompatible changes that might also affect other clients of the PGF run-time library. Also added graphvizDefaults and export it together with GraphvizOptions from the PGF run-time library.
2012-11-22better visualization of parse treespeter.ljunglof
2012-11-22Added C compilation notes for Mac OSXpeter.ljunglof
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-11-12implemented gu_map_count in runtime/c/gu/map.ckr.angelov
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 15:00:05 +0000