kr.angelov
|
52e2298240
|
bugfix for parsing floating point numbers in the C runtime
|
2013-07-18 14:29:58 +00:00 |
|
kr.angelov
|
51da6e1b2a
|
the hash function for pgf.Expr is now really added
|
2013-07-05 05:35:22 +00:00 |
|
kr.angelov
|
4f7369f714
|
the parser in the C runtime now checks for duplicated results
|
2013-07-03 12:30:30 +00:00 |
|
kr.angelov
|
96ea257fa3
|
complete pgf_expr_eq in the C runtime
|
2013-07-02 20:12:57 +00:00 |
|
kr.angelov
|
6971642cc7
|
hash function for abstract syntax trees
|
2013-07-02 19:12:53 +00:00 |
|
kr.angelov
|
1b41792237
|
C runtime: fix the debug modes in the parser and in the reasoner after the changes in the printer
|
2013-06-27 11:00:26 +00:00 |
|
kr.angelov
|
5dc59f815c
|
typos in the documentation for the Python binding
|
2013-06-27 10:11:49 +00:00 |
|
kr.angelov
|
0d68a20d94
|
a complete Python API for reading, printing and manipulation of abstract trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
2013-06-27 09:39:15 +00:00 |
|
kr.angelov
|
6ff0b90a33
|
dummy compute function in the Python binding
|
2013-06-26 10:36:42 +00:00 |
|
kr.angelov
|
03690ccc4b
|
we no longer maintain an explicit list of functions per category since now it is implicitly kept in the JIT compiled code
|
2013-06-26 09:35:50 +00:00 |
|
kr.angelov
|
b47dfd9dbb
|
forgot to add reasoner.h
|
2013-06-26 09:09:54 +00:00 |
|
kr.angelov
|
67872578c9
|
forgot to add jit.h
|
2013-06-26 09:08:47 +00:00 |
|
kr.angelov
|
c873531172
|
an optimization in the jitter for generating more compact code
|
2013-06-26 09:03:51 +00:00 |
|
kr.angelov
|
dba75911b0
|
patch for adjustable heuristics from Python
|
2013-06-26 07:36:03 +00:00 |
|
kr.angelov
|
966d3aee3f
|
compatibility issue for MacOS X
|
2013-06-26 07:03:32 +00:00 |
|
kr.angelov
|
38b3dfcad6
|
fix for x86_64
|
2013-06-26 06:43:33 +00:00 |
|
kr.angelov
|
16584d4368
|
Now there is a just-in-time compiler which generates native code for proof 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-06-25 19:22:42 +00:00 |
|
kr.angelov
|
10eb9dedb6
|
bugfix for the linearizer in the C runtime
|
2013-06-24 07:56:42 +00:00 |
|
kr.angelov
|
aacc15b58f
|
bugfix for the word completion in the C runtime
|
2013-06-22 15:39:47 +00:00 |
|
kr.angelov
|
72cd14a5ae
|
add x86_64 support to GNU lightning
|
2013-06-20 08:27:04 +00:00 |
|
kr.angelov
|
e720d47700
|
fíx in the Python binding for compatibility with Python<2.7
|
2013-06-19 19:31:55 +00:00 |
|
kr.angelov
|
eece31c1ab
|
fix an issue in the Python binding related to the 32 vs 64 bit compatibility
|
2013-06-19 18:47:52 +00:00 |
|
kr.angelov
|
ffa6cbd03c
|
fix for a couple of warnings that are generated when GNU lightning is used
|
2013-06-17 07:32:41 +00:00 |
|
kr.angelov
|
6c4f52faeb
|
add the source code for GNU lightning in the source directory for the C runtime
|
2013-06-17 07:26:00 +00:00 |
|
kr.angelov
|
c3b344084f
|
bugfix in the python binding
|
2013-06-14 07:02:53 +00:00 |
|
kr.angelov
|
1b791158af
|
now the call Expr.unpack("? e1 e2") in Python returns a pair with None as the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees
|
2013-05-31 09:24:15 +00:00 |
|
kr.angelov
|
3566143f37
|
improved error message in the Python binding
|
2013-05-31 09:13:16 +00:00 |
|
kr.angelov
|
935ae49376
|
bugfix for the grammar printer in the C runtime
|
2013-05-30 20:20:02 +00:00 |
|
kr.angelov
|
d66dfe13c2
|
a simple refactoring in the Python runtime
|
2013-05-29 11:02:18 +00:00 |
|
kr.angelov
|
fac39a78fe
|
readPGF in the Python runtime now throws "No such file or directory" exception if the grammar is missing
|
2013-05-29 10:49:56 +00:00 |
|
kr.angelov
|
e969aa69ff
|
added a test class for the Java API plus a small refinement in the implementation for the binding
|
2013-05-28 13:32:32 +00:00 |
|
kr.angelov
|
bd859fcf28
|
an initial skeleton for building a Java binding to the C runtime
|
2013-05-28 12:59:19 +00:00 |
|
kr.angelov
|
78aab96369
|
fix the encoding problem with unicode literals in the Python binding
|
2013-05-21 10:53:20 +00:00 |
|
kr.angelov
|
f9f0fdcdf8
|
bugfix for bracketedLinearize which was causing crash if the tree cannot be linearized
|
2013-05-07 08:35:33 +00:00 |
|
kr.angelov
|
2eb37f6407
|
bug fix in the management of memory pools in the statistical parser
|
2013-05-07 08:30:32 +00:00 |
|
kr.angelov
|
561e478ed4
|
the statistical parser is now using two memory pools: one for parsing and 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-06 15:28:04 +00:00 |
|
kr.angelov
|
307e0854ed
|
fix the leftcorner filtering after the addition of word completion
|
2013-05-05 10:30:06 +00:00 |
|
kr.angelov
|
be8d72d64c
|
bugfix in the C runtime which was causing an infinite loop while linearizing partial trees
|
2013-05-04 13:32:57 +00:00 |
|
gregoire.detrez
|
cf5c6b18d9
|
[haskell runtime] Remove trailing whitespaces in VisualizeTree.hs
|
2013-05-03 09:42:29 +00:00 |
|
kr.angelov
|
9cdd96363a
|
word completion in the C runtime. The runtime/python/test.py example is now using readline with word completion
|
2013-05-01 06:09:55 +00:00 |
|
kr.angelov
|
6cc44193b8
|
finally the statistical parser is able to return all possible abstract trees
|
2013-04-26 20:44:01 +00:00 |
|
kr.angelov
|
f4cf8deab7
|
a trivial refactoring of the reasoner in the C runtime
|
2013-04-23 06:40:14 +00:00 |
|
kr.angelov
|
5aee2c4473
|
bug fix in pgf-translate which was hiding that there are more than one trees per sentence
|
2013-04-22 13:02:43 +00:00 |
|
kr.angelov
|
ffd64cc02a
|
reverse the direction of the arcs in the dependency trees
|
2013-04-21 19:20:08 +00:00 |
|
kr.angelov
|
d6d4ae3a6b
|
remove the dead code left behind by Peter Ljunglöf in VisualizeTree
|
2013-04-19 11:13:07 +00:00 |
|
kr.angelov
|
15fd8b15ab
|
the C runtime and the Python binding now have an API for parser evaluation. 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-19 10:57:46 +00:00 |
|
kr.angelov
|
2a0c69a412
|
added API for computing bracketed strings from Python and C
|
2013-04-18 13:37:09 +00:00 |
|
kr.angelov
|
cb7025dc11
|
added a malt_tab format to the vd command in the GF shell
|
2013-04-16 18:22:37 +00:00 |
|
kr.angelov
|
d5666aebd0
|
the generation of dependency trees in the Haskell runtime is now finally working with bracketed strings. This also fixes some errors in the old implementation
|
2013-04-16 13:10:48 +00:00 |
|
kr.angelov
|
44828765c3
|
the compiler now sorts the list of functions per category in probability order. this ensures probability order search in the C runtime
|
2013-04-15 19:58:57 +00:00 |
|