gf-core.git/src/runtime/haskell/PGF/Probabilistic.hs, branch optimizeUnnamed repository; edit this file 'description' to name the repository.
https://git.adelon.net/gf-core.git/atom?h=optimize2017-09-01T12:31:08+00:00silence Tab warnings in the Haskell runtime2017-09-01T12:31:08+00:00Krasimir Angelovkr.angelov@gmail.com2017-09-01T12:31:08+00:00urn:sha1:bbdbf2bc5d34d75cef032b395e4a5cc35a89066dComment out some dead code found with -fwarn-unused-binds2015-08-28T13:59:43+00:00hallgrenhallgren@chalmers.se2015-08-28T13:59:43+00:00urn:sha1:5bfaf10de597af504e6d2784309e533b09a6451c
Also fixed some warnings and tightened some imports
a partial support for def rules in the C runtime2014-08-11T10:59:10+00:00kr.angelovkr.angelov@gmail.com2014-08-11T10:59:10+00:00urn:sha1:584d589041f63fdd3ea777019679275657902c2d
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.
ensure that negative probabilities are always avoided2014-03-12T13:11:23+00:00kr.angelovkr.angelov@gmail.com2014-03-12T13:11:23+00:00urn:sha1:ebb61fbf1cf217d447f2d016b0e557e775c85271the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The 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.gf2013-11-06T10:21:46+00:00kr.angelovkr.angelov@gmail.com2013-11-06T10:21:46+00:00urn:sha1:2483dc772897eb0909664f1a88cc7f8ec50ebd5bEliminate mutual dependencies between the GF compiler and the PGF library2013-11-05T13:11:10+00:00hallgrenhallgren@chalmers.se2013-11-05T13:11:10+00:00urn:sha1:3814841d7d3b77b3f033cb98c1c0a04ac39435d7
+ References to modules under src/compiler have been eliminated from the PGF
library (under src/runtime/haskell). Only two functions had to be moved (from
GF.Data.Utilities to PGF.Utilities) to make this possible, other apparent
dependencies turned out to be vacuous.
+ In gf.cabal, the GF executable no longer directly depends on the PGF library
source directory, but only on the exposed library modules. This means that
there is less duplication in gf.cabal and that the 30 modules in the
PGF library will no longer be compiled twice while building GF.
To make this possible, additional PGF library modules have been exposed, even
though they should probably be considered for internal use only. They could
be collected in a PGF.Internal module, or marked as "unstable", to make
this explicit.
+ Also, by using the -fwarn-unused-imports flag, ~220 redundant imports were
found and removed, reducing the total number of imports by ~15%.
the first approximation for a statistical model consistent with dependent types in the abstract syntax2013-07-30T07:29:11+00:00kr.angelovkr.angelov@gmail.com2013-07-30T07:29:11+00:00urn:sha1:383d829d5a435125a82e39d31e22cded0401e230the compiler now sorts the list of functions per category in probability order. this ensures probability order search in the C runtime2013-04-15T19:58:57+00:00kr.angelovkr.angelov@gmail.com2013-04-15T19:58:57+00:00urn:sha1:2f359648711b39b42240ffb8d23214921bea721bA basic infrastructure for generating Teyjus bytecode from the GF abstract syntax2012-08-29T11:43:02+00:00kr.angelovkr.angelov@gmail.com2012-08-29T11:43:02+00:00urn:sha1:f8fe23fda7b97d5301bfb2ec1d89ce9967c5b200bugfix: setProbabilities should be more robust when there are missing probabilities for some functions or categories2010-12-17T09:09:07+00:00krasimirkrasimir@chalmers.se2010-12-17T09:09:07+00:00urn:sha1:e4b2b8541feba5c75316034b191c3b3bcdd8b9d2