diff options
| author | kr.angelov <kr.angelov@gmail.com> | 2013-07-30 11:51:49 +0000 |
|---|---|---|
| committer | kr.angelov <kr.angelov@gmail.com> | 2013-07-30 11:51:49 +0000 |
| commit | 80dbbb88b8f0fa858da5b68a5b6b0804ee8c2037 (patch) | |
| tree | a3109d571cff054880a3202024ec76342fa51b89 | |
| parent | 383d829d5a435125a82e39d31e22cded0401e230 (diff) | |
added release notes for the C runtime
| -rw-r--r-- | download/release-3.4.8.t2t | 17 |
1 files changed, 15 insertions, 2 deletions
diff --git a/download/release-3.4.8.t2t b/download/release-3.4.8.t2t index 8edc2ffb3..7f6130ee0 100644 --- a/download/release-3.4.8.t2t +++ b/download/release-3.4.8.t2t @@ -18,8 +18,21 @@ See the [download page http://www.grammaticalframework.org/download/index.html]. Compatibility with GHC 7.4 is also maintained. - A bug in the partial evaluator that caused problems with pattern macros has been fixed. -- [...] - +- The new runtime in C is now stable enough to be used although there +are still features from the Haskell runtime which are not ported yet. +The new runtime provides the following new features: + - state of the art statistical parser for GF (PMCFG) + - the parser is usable in a robust mode, i.e. even if the + sentence is not in the scope of the grammar it is still possible + to get a list of parsable chunks + - the linearizer is also more robust than the one in Haskell since + it can linearize the partial trees returned from the robust parser + - the exhaustive generation for GF abstract trees generates the trees + in decreasing probability order (the order in Haskell is unspecified). + - we have started using just-in-time compilation to native code in + the exhaustive generator. The goal is to reach the state where + GF will provide state of the art theorem prover. +[/src/runtime/c/ ../src/runtime/c/] ===Resource Grammar Library=== |
