kr.angelov
8f2032a07d
the parser in the C runtime now checks for duplicated results
2013-07-03 12:30:30 +00:00
kr.angelov
f0c703d42f
complete pgf_expr_eq in the C runtime
2013-07-02 20:12:57 +00:00
kr.angelov
2948231e0f
hash function for abstract syntax trees
2013-07-02 19:12:53 +00:00
kr.angelov
c0a0859566
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
478b46be87
typos in the documentation for the Python binding
2013-06-27 10:11:49 +00:00
kr.angelov
155afdf9b7
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
f4f76e4638
dummy compute function in the Python binding
2013-06-26 10:36:42 +00:00
kr.angelov
d1410aba22
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
fcd2a2b12a
forgot to add reasoner.h
2013-06-26 09:09:54 +00:00
kr.angelov
cf0bc127af
forgot to add jit.h
2013-06-26 09:08:47 +00:00
kr.angelov
a2af8e216f
an optimization in the jitter for generating more compact code
2013-06-26 09:03:51 +00:00
kr.angelov
3c2d1890d0
patch for adjustable heuristics from Python
2013-06-26 07:36:03 +00:00
kr.angelov
d94b6146f2
compatibility issue for MacOS X
2013-06-26 07:03:32 +00:00
kr.angelov
3a22258109
fix for x86_64
2013-06-26 06:43:33 +00:00
kr.angelov
d553cb165a
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
09a42bbab0
bugfix for the linearizer in the C runtime
2013-06-24 07:56:42 +00:00
kr.angelov
9058ccb3eb
bugfix for the word completion in the C runtime
2013-06-22 15:39:47 +00:00
kr.angelov
fa7ac00838
add x86_64 support to GNU lightning
2013-06-20 08:27:04 +00:00
kr.angelov
f8073ea1cd
fíx in the Python binding for compatibility with Python<2.7
2013-06-19 19:31:55 +00:00
kr.angelov
0ad4c9bf65
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
e65bbb0713
fix for a couple of warnings that are generated when GNU lightning is used
2013-06-17 07:32:41 +00:00
kr.angelov
407f680bae
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
b0b4f57775
bugfix in the python binding
2013-06-14 07:02:53 +00:00
kr.angelov
54a0642bee
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
1ce5fa3663
improved error message in the Python binding
2013-05-31 09:13:16 +00:00
kr.angelov
aa644169c2
bugfix for the grammar printer in the C runtime
2013-05-30 20:20:02 +00:00
kr.angelov
739b10f2a8
a simple refactoring in the Python runtime
2013-05-29 11:02:18 +00:00
kr.angelov
43bffd3f7d
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
bae05df3b0
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
3147e16453
an initial skeleton for building a Java binding to the C runtime
2013-05-28 12:59:19 +00:00
kr.angelov
b7cbee7940
fix the encoding problem with unicode literals in the Python binding
2013-05-21 10:53:20 +00:00
kr.angelov
517b8ff1ee
bugfix for bracketedLinearize which was causing crash if the tree cannot be linearized
2013-05-07 08:35:33 +00:00
kr.angelov
687b326ed0
bug fix in the management of memory pools in the statistical parser
2013-05-07 08:30:32 +00:00
kr.angelov
7ba27229b3
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
520c2fb59d
fix the leftcorner filtering after the addition of word completion
2013-05-05 10:30:06 +00:00
kr.angelov
b8d61fcbb2
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
08a67b9f34
[haskell runtime] Remove trailing whitespaces in VisualizeTree.hs
2013-05-03 09:42:29 +00:00
kr.angelov
22f44ef61f
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
85efdf81e7
finally the statistical parser is able to return all possible abstract trees
2013-04-26 20:44:01 +00:00
kr.angelov
aad274022a
a trivial refactoring of the reasoner in the C runtime
2013-04-23 06:40:14 +00:00
kr.angelov
6481f448fc
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
b1b68bf6b4
reverse the direction of the arcs in the dependency trees
2013-04-21 19:20:08 +00:00
kr.angelov
4e2044ab99
remove the dead code left behind by Peter Ljunglöf in VisualizeTree
2013-04-19 11:13:07 +00:00
kr.angelov
542dcaa0ec
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
f050609101
added API for computing bracketed strings from Python and C
2013-04-18 13:37:09 +00:00
kr.angelov
b49b9d459a
added a malt_tab format to the vd command in the GF shell
2013-04-16 18:22:37 +00:00
kr.angelov
f6d675c34b
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
2f35964871
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
hallgren
b8ce5ef5b3
PGF.hs: export function missingLins
...
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-08 15:38:11 +00:00
kr.angelov
1f91928606
now the web service to the robust parser can to translations also
2013-04-05 12:22:52 +00:00
