| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2014-03-06 | C run-time: protect from Windows specific #includes with #ifdef __MINGW32__ | hallgren | |
| 2014-02-27 | include malloc.h in a few places to avoid warnings on Windows | kr.angelov | |
| 2013-12-17 | make sure that pgf_concrete_load has no effect on grammars that are ↵ | kr.angelov | |
| completely loaded | |||
| 2013-12-10 | loading and unloading of languages in the C runtime and in the Python bindings | kr.angelov | |
| 2013-11-15 | pgf_reader_done should do nothing if the reading has failed | kr.angelov | |
| 2013-11-12 | added Predef.SOFT_BIND. This special token allows zero or more spaces ↵ | kr.angelov | |
| between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word. | |||
| 2013-11-07 | factor of 3 speedup for the translation without slowing down the grammar ↵ | kr.angelov | |
| loading. The parser still seems to be 8 times slower than before I introduced the BIND. At least the Android UI now feels a lot more comfortable | |||
| 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-10-30 | added the linref construction in GF. The PGF version number is now bumped | kr.angelov | |
| 2013-10-28 | fix the handling of 'pre' in the C runtime | 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-27 | a major refactoring in the C and the Haskell runtimes. Note incompatible ↵ | kr.angelov | |
| change in the PGF format!!! The following are the outcomes: - Predef.nonExist is fully supported by both the Haskell and the C runtimes - Predef.BIND is now an internal compiler defined token. For now it behaves just as usual for the Haskell runtime, i.e. it generates &+. However, the special treatment will let us to handle it properly in the C runtime. - This required a major change in the PGF format since both nonExist and BIND may appear inside 'pre' and this was not supported before. | |||
| 2013-09-18 | the PGF reader now releases strings that are not used after the loading | kr.angelov | |
| 2013-09-17 | a major refactoring in the C runtime. GuList is now removed and replaced ↵ | kr.angelov | |
| with GuSeq. The GuSeq/GuBuf API is simplified | |||
| 2013-09-13 | remove leftcorner_cat_idx which is now redundant | kr.angelov | |
| 2013-09-13 | minor optimization/refactoring in the grammar reader | kr.angelov | |
| 2013-09-13 | tiny optimization in pgf/reader | kr.angelov | |
| 2013-09-13 | optimize the reading of strings in the grammar loader. | kr.angelov | |
| 2013-09-12 | enable the PGF JIT compiler for Android | kr.angelov | |
| 2013-09-05 | remove the string internalization since it slows down grammar loading with ↵ | kr.angelov | |
| little benefit | |||
| 2013-09-05 | remove the read and write modules from libgu. this simplifies the i/o layer | kr.angelov | |
| 2013-09-04 | added make file for compiling the C runtime for Android. The JIT compiler ↵ | kr.angelov | |
| for Android is temporary disabled | |||
| 2013-09-04 | remove the dependency on the HAVE_STATEMENT_EXPRESSIONS flag. This reduces ↵ | kr.angelov | |
| the dependency on the ./configure script | |||
| 2013-08-23 | nonExist now does the expected thing | 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 | we no longer maintain an explicit list of functions per category since now ↵ | kr.angelov | |
| it is implicitly kept in the JIT compiled code | |||
| 2013-06-25 | Now 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-04-26 | finally the statistical parser is able to return all possible abstract trees | kr.angelov | |
| 2013-04-18 | added API for computing bracketed strings from Python and C | kr.angelov | |
| 2013-02-19 | bugfix in the grammar reader in the C runtime | kr.angelov | |
| 2013-02-11 | refactoring: now all named objects in the C runtime have an explicit name field | kr.angelov | |
| 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-11 | the grammar reader in the C runtime is completely rewritten and it doesn't ↵ | kr.angelov | |
| use the generic programming API | |||
| 2013-01-07 | a 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-19 | a major reimplementation of the linearizer in the C runtime | kr.angelov | |
| 2012-12-12 | started an official API to the C runtime | kr.angelov | |
| 2012-10-29 | use prob_t instead of float in a few places | kr.angelov | |
| 2012-10-25 | a major refactoring in the robust parser: bottom-up filtering and garbage ↵ | kr.angelov | |
| collection for the chart | |||
| 2012-09-24 | now the meta probability for a category is explicitly specified in the ↵ | kr.angelov | |
| statistical model instead of computed internally. this avoids rounding errors while computing the sum of a large number of small values. | |||
| 2012-09-18 | the C runtime now has a type prob_t which is used only for probability values | kr.angelov | |
| 2012-09-06 | bugfix in the C parser | kr.angelov | |
| 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-08 | a new unbiased statistical parser. it is still far from perfect use it on ↵ | kr.angelov | |
| your own risk. | |||
| 2012-03-12 | libpgf: a new implementation for literals which also allows custom literals. ↵ | kr.angelov | |
| the same mechanism is now used for the metavariables | |||
| 2012-03-07 | libpgf: implementation for built in literal categories | kr.angelov | |
| 2012-03-05 | libpgf: now all concrete functions and categories are explicitly linked to ↵ | kr.angelov | |
| their abstract counter parts | |||
| 2012-02-29 | libpgf: the first prototype for the robust parser | kr.angelov | |
| 2012-02-24 | libpgf: fix in pgf_read_into_map | kr.angelov | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |