| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-05-31 | now the call Expr.unpack("? e1 e2") in Python returns a pair with None as ↵ | kr.angelov | |
| the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees | |||
| 2013-05-31 | improved error message in the Python binding | kr.angelov | |
| 2013-05-30 | bugfix for the grammar printer in the C runtime | kr.angelov | |
| 2013-05-29 | a simple refactoring in the Python runtime | kr.angelov | |
| 2013-05-29 | readPGF in the Python runtime now throws "No such file or directory" ↵ | kr.angelov | |
| exception if the grammar is missing | |||
| 2013-05-28 | added a test class for the Java API plus a small refinement in the ↵ | kr.angelov | |
| implementation for the binding | |||
| 2013-05-28 | an initial skeleton for building a Java binding to the C runtime | kr.angelov | |
| 2013-05-21 | fix the encoding problem with unicode literals in the Python binding | kr.angelov | |
| 2013-05-07 | bugfix for bracketedLinearize which was causing crash if the tree cannot be ↵ | kr.angelov | |
| linearized | |||
| 2013-05-07 | bug fix in the management of memory pools in the statistical parser | 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-05 | fix the leftcorner filtering after the addition of word completion | kr.angelov | |
| 2013-05-04 | bugfix in the C runtime which was causing an infinite loop while linearizing ↵ | kr.angelov | |
| partial trees | |||
| 2013-05-03 | [haskell runtime] Remove trailing whitespaces in VisualizeTree.hs | gregoire.detrez | |
| 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-26 | finally the statistical parser is able to return all possible abstract trees | kr.angelov | |
| 2013-04-23 | a trivial refactoring of the reasoner in the C runtime | kr.angelov | |
| 2013-04-22 | bug fix in pgf-translate which was hiding that there are more than one trees ↵ | kr.angelov | |
| per sentence | |||
| 2013-04-21 | reverse the direction of the arcs in the dependency trees | kr.angelov | |
| 2013-04-19 | remove the dead code left behind by Peter Ljunglöf in VisualizeTree | kr.angelov | |
| 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-04-18 | added API for computing bracketed strings from Python and C | kr.angelov | |
| 2013-04-16 | added a malt_tab format to the vd command in the GF shell | kr.angelov | |
| 2013-04-16 | the generation of dependency trees in the Haskell runtime is now finally ↵ | kr.angelov | |
| working with bracketed strings. This also fixes some errors in the old implementation | |||
| 2013-04-15 | the compiler now sorts the list of functions per category in probability ↵ | kr.angelov | |
| order. this ensures probability order search in the C runtime | |||
| 2013-04-08 | PGF.hs: export function missingLins | hallgren | |
| Also in Commands.hs: be explicit about things imported from the PGF library that are not in the public API. Also a couple of haddock documentation fixes. | |||
| 2013-04-05 | now the web service to the robust parser can to translations also | kr.angelov | |
| 2013-04-05 | a bugfix which was causing an infinite loop in the C linearizer for some ↵ | kr.angelov | |
| sentences | |||
| 2013-04-05 | a very simple linearization for partial abstract trees in the C runtime | kr.angelov | |
| 2013-04-02 | Replace "CId" with "Language" in type signature for PGF.tabularLinearizes | john.j.camilleri | |
| 2013-03-26 | haddock bug workaround | hallgren | |
| 2013-03-20 | the calculation of lexical_prob in the statistical parser doesn't work ↵ | kr.angelov | |
| properly. It should be fixed but for now I just disabled the optimization | |||
| 2013-03-20 | replace #if with #ifdef when checking for the optional bottom up filtering ↵ | kr.angelov | |
| in the C runtime | |||
| 2013-03-19 | the bottom up filtering in the C runtime is temporary disabled. It takes too ↵ | kr.angelov | |
| much memory and even makes it impossible to load the Finnish and the German parsing grammars. | |||
| 2013-03-14 | bug fix in the linearizer in the C runtime | kr.angelov | |
| 2013-03-14 | update the pgf-service tool from the C runtime after the changes in the API | kr.angelov | |
| 2013-03-11 | bugfix in the statistical parser | kr.angelov | |
| 2013-03-09 | ghc-7.6: add missing Num instance for Bits | Sergei Trofimovich | |
| Fixes the following build failure: src/runtime/haskell/Data/Binary/IEEE754.lhs:256:17: Could not deduce (Num a) arising from a use of `mask' from the context (Bits a) bound by the type signature for clamp :: Bits a => BitCount -> a -> a | |||
| 2013-02-26 | added gu_buf_flush in seq.c which removes all elements from a buffer | kr.angelov | |
| 2013-02-19 | the parser in the C runtime should not crash if the start category is not ↵ | kr.angelov | |
| defined | |||
| 2013-02-19 | bugfix in the grammar reader in the C runtime | kr.angelov | |
| 2013-02-13 | bugfix in the linearizer for the C runtime | kr.angelov | |
| 2013-02-13 | Fix for a PGF portability problem | hallgren | |
| GF produced slightly different PGF files on 64-bit systems and 32-bit systems. This could cause problems when a PGF was produced on a 32-bit system and used on a 64-bit system. To fix this, the GF compiler and the Haskell PGF run-time library now reads and writes PGF files like the 32-bit version even when compiled on a 64-bit system. Note: the Haskell type Int is still used internally in GF, which could be 32 bits or 64 bits... | |||
| 2013-02-12 | now the beam size for the statistical parser can be configured by using the ↵ | kr.angelov | |
| flag beam_size in the top-level concrete module | |||
| 2013-02-12 | the statistical parser now uses a baseline lexical estimation of the beam size | kr.angelov | |
| 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 | 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-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 | |||
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |