| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-11-22 | PGFService.hs: fix type error caused by change to PGF.graphvizParseTree | hallgren | |
| 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-22 | better visualization of parse trees | peter.ljunglof | |
| 2012-08-30 | another fix for teyjus | kr.angelov | |
| 2012-08-30 | the loading of PGF files was broken by the Teyjus patch. Now this is fixed | kr.angelov | |
| 2012-08-29 | Use nub' instead of nub in some places, remove some unused nub imports | peter.ljunglof | |
| 2012-08-29 | Added an O(n log n) version of nub | peter.ljunglof | |
| The new nub is called nub', and it replaces the old sortNub which was not lazy and did not retain the order between the elements. | |||
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2012-06-10 | command option ma -known to drop unknown words | aarne | |
| 2012-03-26 | Fix List.foldl / Map.foldl ambiguosity | Sergei Trofimovich | |
| Fixes the following error: src/runtime/haskell/PGF/Expr.hs:111:14: Ambiguous occurrence `foldl' It could refer to either `List.foldl', imported from `Data.List' at src/runtime/haskell/PGF/Expr.hs:27:1-24 (and originally defined in `GHC.List') or `Map.foldl', imported from `Data.Map' at src/runtime/haskell/PGF/Expr.hs:28:1-40 | |||
| 2012-03-18 | PGF run-time library: function names in BracketedString (experimental) | hallgren | |
| + Make room for function names in the BracketedString data structure. + Fill in function names when linearizing an abstract syntax tree to a BracketedString. + Fill in wildCId when it is not obvious what the function is. + Function bracketedLinearize: for compatibility with the other linearization functions, return Leaf "" instead of error "cannot linearize". + Export flattenBracketedString from module PGF. + PGFServce: make function names available in the JSON representation of BracketedString. | |||
| 2011-12-19 | the parser now use nub instead of nubsort which means that the abstract ↵ | kr.angelov | |
| syntax trees will be returned lazily | |||
| 2011-12-08 | Now graphvizAbstractTree suppress the visualization of implicit arguments. | kr.angelov | |
| 2011-11-15 | now we store version number in every .gfo file. If the file is compiled with ↵ | kr.angelov | |
| different compiler then we simply recompile it. | |||
| 2011-11-10 | Now PMCFG is compiled per module and at the end we only link it. The new ↵ | kr.angelov | |
| compilation schema is few times faster. | |||
| 2011-10-25 | Preparations for release of GF 3.3 | hallgren | |
| + Changing version numbers and dates here and there. + Simplify build-binary-dist.sh since pgf-http need not be built anymore. + Use--gf-lib-path to make the sample grammars for minibar compile even if GF is not installed. | |||
| 2011-09-21 | fix in the proof search. when we start the generation from a template, we ↵ | kr.angelov | |
| must start the refinement from the expression that the typecheker generated | |||
| 2011-09-15 | added topological sort module to PGF - to be used in example based grammar ↵ | ra.monique | |
| writing | |||
| 2011-09-14 | quick fixes in PGF.TypeCheck suggested by Krasimir; to be revisited | aarne | |
| 2011-08-30 | bugfixes in the typechecker and the tree generator | kr.angelov | |
| 2011-08-30 | bugfix: allow higher-order variables in the linearization | kr.angelov | |
| 2011-08-29 | skip spaces before closing parenthesis in PGF.Expr.pFactor | aarne | |
| 2011-08-28 | import command now gives priority to new abstract syntax, and discards the ↵ | aarne | |
| old concretes if they are for the old abstract; the new priority is implemented in PGF.Data.unionPGF | |||
| 2011-03-17 | Adding a missing file for the tokenizer... | gdetrez | |
| 2011-02-06 | a simple clitic analysis command 'ca' | aarne | |
| 2011-01-08 | fix the computation of abstract expressions in the presence of implicit ↵ | krasimir | |
| arguments | |||
| 2011-01-08 | bugfix in the handling of implicit arguments in the typechecker | krasimir | |
| 2010-12-17 | bugfix: setProbabilities should be more robust when there are missing ↵ | krasimir | |
| probabilities for some functions or categories | |||
| 2010-12-14 | now every parse state keeps reference only to the concrete and the abstract ↵ | krasimir | |
| syntaxes but not to the whole PGF | |||
| 2010-12-14 | work-around in Tree.expr2tree to make Paraphrase work | aarne | |
| 2010-12-14 | optimization in the parser for large lexicons. Now, the parser is slightly ↵ | krasimir | |
| slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary | |||
| 2010-12-08 | fixed typos in the documentation for PGF.Parse | krasimir | |
| 2010-12-06 | simple refactoring in PGF.Macros and related | krasimir | |
| 2010-12-07 | moved PGF.ToApi to GF.Compile.ToAPI | aarne | |
| 2010-12-06 | no more IO in the syntax to API translator | ra.monique | |
| 2010-12-06 | vt -api with conversion to resource API names | aarne | |
| 2010-12-05 | added syntax to api translation module | ra.monique | |
| 2010-11-24 | command ai in the shell now shows the probability of the tree | krasimir | |
| 2010-11-12 | operations in the abstract syntax | krasimir | |
| 2010-10-31 | added giza Alignments with command ga and merged the rendering algorithm for ↵ | ramona.enache | |
| graphviz and giza alignments | |||
| 2010-10-25 | when faced with hard unification problem the type checker should just ↵ | krasimir | |
| postpone the decision instead of failing immediately. added test case as well | |||
| 2010-10-25 | when we print the bracketed string it is useful to print the attached ↵ | krasimir | |
| metavariables as well | |||
| 2010-10-21 | change the TcM monad to continuation passing style. The old monad caused ↵ | krasimir | |
| stack overflow for large search spaces | |||
| 2010-10-21 | support for proof search with high-order functions | krasimir | |
| 2010-10-20 | bugfix in the term generation | krasimir | |
| 2010-10-20 | fixed typo which broke the parsing with -openclass | krasimir | |
| 2010-10-19 | in the type checker monad we should use lazy pattern matching because ↵ | krasimir | |
| otherwise we force the exhaustive tree generation to be strict | |||
| 2010-10-18 | added explicit depth parameter to the parsing API and the corresponding ↵ | krasimir | |
| command in the shell | |||
| 2010-10-18 | typo in PGF.TypeCheck which spoiled the previous patch | krasimir | |
| 2010-10-18 | now we use the GF reasoner to fillin meta variables in the abstract trees ↵ | krasimir | |
| generated from the parser | |||
| 2010-10-14 | now since the type checking monad TcM is nondeterministic we can use the ↵ | krasimir | |
| same monad in PGF.Forest.getAbsTrees | |||
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |