| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-08-30 | bugfix for hasLinearization in the Haskell binding | Krasimir Angelov | |
| 2017-05-04 | merging spines | krasimir | |
| 2017-05-03 | first steps for sentence lookup in the C runtime | krasimir | |
| 2017-04-19 | explicitly classify all functions in libpgf as either internal or API functions | krasimir | |
| 2017-01-26 | bring the Haskell binding a bit closer to the pure Haskell API | krasimir | |
| 2016-05-30 | added getFunctionProb in the Java and C API | krasimir | |
| 2016-05-10 | an API for oracles in the GF parser | krasimir | |
| 2015-07-03 | merge the states for reasoning and evaluation into a single structure | krasimir | |
| 2015-05-18 | the callbacks in C now take the concrete syntax as a parameter | krasimir | |
| 2014-12-29 | API for word alignment in the C runtime and in the Haskell binding | kr.angelov | |
| 2014-12-16 | change in the API for literals | kr.angelov | |
| The API in the C runtime as well as in the Haskell, Python and Java binding is changed. Now instead of adding the literal callbacks to the concrete syntax you need to supply them every time when you need to parse. The main reason is: - referentially transparent API for Haskell - when we start using memory mapped files we will not be allowed to change anything in the grammar data structures. At that point the old API would be impossible to use. | |||
| 2014-10-09 | throw away the long obsolete runtime type information in the C runtime | kr.angelov | |
| 2014-10-09 | replace the hash maps in the abstract syntax with binary search tables | kr.angelov | |
| 2014-08-11 | a partial support for def rules in the C runtime | kr.angelov | |
| The def rules are now compiled to byte code by the compiler and then to native code by the JIT compiler in the runtime. Not all constructions are implemented yet. The partial implementation is now in the repository but it is not activated by default since this requires changes in the PGF format. I will enable it only after it is complete. | |||
| 2014-07-08 | implemented computing with abstract syntax trees. It passes all test cases ↵ | kr.angelov | |
| except those that require def rules. The design is consistent with the STG virtual machine | |||
| 2014-07-06 | embedded mode for GF grammar in Python. Only generation for now | kr.angelov | |
| 2014-04-25 | an initial Java/C API for predicting literals. Still not utilized | kr.angelov | |
| 2014-04-10 | now fully functional Java API for custom literals | kr.angelov | |
| 2014-03-07 | added pgf_lookup_word_prefix which makes it possible to do simple word ↵ | kr.angelov | |
| prediction | |||
| 2013-11-27 | added API in the C runtime and the Java binding for checking whether a given ↵ | kr.angelov | |
| function is linearizable in a given language. This is used in the Android UI for better vizualizations | |||
| 2013-11-20 | fix in the Python binding | kr.angelov | |
| 2013-11-06 | the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The ↵ | kr.angelov | |
| later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf | |||
| 2013-11-04 | A simple type checker in the C runtime. Dependent types are not supported ↵ | kr.angelov | |
| yet but HOAS is implemented. The API is accessible from Python as well | |||
| 2013-10-23 | tabular linearization in the C and Java runtimes | kr.angelov | |
| 2013-10-09 | a major redesign in the C runtime. The parser and the linearizer now fully ↵ | kr.angelov | |
| support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode | |||
| 2013-10-04 | GuString is now an ordinary C string - it makes live easier. In addition ↵ | kr.angelov | |
| PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use. | |||
| 2013-09-05 | remove the read and write modules from libgu. this simplifies the i/o layer | kr.angelov | |
| 2013-08-19 | fullFormLexicon in C and Python | kr.angelov | |
| 2013-08-16 | implemented lookupMorpho for C and Python | kr.angelov | |
| 2013-08-16 | provide API to access the language code for the concrete language | kr.angelov | |
| 2013-08-16 | fixes in the C and Python API to make them closer to the Haskell API | kr.angelov | |
| 2013-06-27 | a complete Python API for reading, printing and manipulation of abstract ↵ | kr.angelov | |
| trees and types. This includes dependent types, high-order abstract syntax and implicit arguments | |||
| 2013-06-26 | patch for adjustable heuristics from Python | kr.angelov | |
| 2013-05-06 | the 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-01 | word completion in the C runtime. The runtime/python/test.py example is now ↵ | kr.angelov | |
| using readline with word completion | |||
| 2013-04-19 | the 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-02-11 | the class PgfConcr from the Python binding now has a property name which ↵ | kr.angelov | |
| returns the name of the concrete syntax | |||
| 2013-02-11 | remove 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-01 | This 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-24 | Python 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.) | |||
| 2012-12-14 | The 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-13 | a top-level API for parsing in the C runtime | kr.angelov | |
| 2012-12-12 | started an official API to the C runtime | kr.angelov | |
| 2012-10-25 | a major refactoring in the robust parser: bottom-up filtering and garbage ↵ | kr.angelov | |
| collection for the chart | |||
| 2012-06-12 | now 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-12 | now the robust parser is purely top-down and the meta rules compete on a ↵ | kr.angelov | |
| fair basis with the grammar rules | |||
| 2012-05-16 | another attempt to port the robust parser to MacOS | kr.angelov | |
| 2012-01-21 | added an API for printing the PGF to human readable format | kr.angelov | |
| 2012-01-20 | initial import of the C runtime | kr.angelov | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |