kr.angelov
b70cea2673
bugfix in the handling of BIND in the C runtime
2014-04-22 13:53:18 +00:00
kr.angelov
b0b27a1b32
now word completion from Java works. It could be made better
2014-04-17 11:00:27 +00:00
kr.angelov
1ca09448f9
now fully functional Java API for custom literals
2014-04-10 14:14:31 +00:00
kr.angelov
f99d3033aa
bugfix in the C runtime that shows up with only some grammars
2014-04-08 12:41:41 +00:00
kr.angelov
911ae42296
small fixes in the C runtime
2014-03-25 13:57:57 +00:00
kr.angelov
a1446b87fa
whitespace cleanup in the parser
2014-03-18 10:19:35 +00:00
kr.angelov
ae1512c926
compute the right word probability
2014-03-12 15:36:40 +00:00
kr.angelov
ba28cfd80e
added pgf_lookup_word_prefix which makes it possible to do simple word prediction
2014-03-07 21:24:20 +00:00
kr.angelov
0ece8f19ab
loading and unloading of languages in the C runtime and in the Python bindings
2013-12-10 15:00:52 +00:00
kr.angelov
1d2786f7da
bugfix in the debug mode for the parser
2013-11-22 12:26:49 +00:00
kr.angelov
aad6a1c4bb
bugfix in the C runtime
2013-11-21 14:31:28 +00:00
kr.angelov
5b83da5583
bugfix in the robust parser
2013-11-18 09:05:27 +00:00
kr.angelov
126d5e0278
bugfix in the C runtime which had made the parser up to 200 times slower for some sentences
2013-11-13 15:15:28 +00:00
kr.angelov
0095119ec0
added Predef.SOFT_BIND. This special token allows zero or more spaces between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word.
2013-11-12 09:54:57 +00:00
kr.angelov
af4a1f628d
factor of 3 speedup for the translation without slowing down the grammar loading. The parser still seems to be 8 times slower than before I introduced the BIND. At least the Android UI now feels a lot more comfortable
2013-11-07 11:14:32 +00:00
kr.angelov
f9d044d294
fix in the parsing with pre
2013-11-06 16:25:25 +00:00
kr.angelov
2483dc7728
the 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.gf
2013-11-06 10:21:46 +00:00
kr.angelov
981a728d13
fix the robust parser for unknown tokens
2013-11-01 13:05:17 +00:00
kr.angelov
fed16ca9e5
use linref in the C linearizer. The robust linearization is now fully supported
2013-10-30 21:43:52 +00:00
kr.angelov
042243f08a
added the linref construction in GF. The PGF version number is now bumped
2013-10-30 12:53:36 +00:00
kr.angelov
c60a019b70
another fix for 'pre'
2013-10-28 13:54:06 +00:00
kr.angelov
151f86c1e9
fix the handling of 'pre' in the C runtime
2013-10-28 12:35:37 +00:00
kr.angelov
53631576dc
bugfix for the custom literals in the C runtime
2013-10-21 12:34:57 +00:00
kr.angelov
268e9a7960
avoid warning in parser.c when debugging is OFF
2013-10-09 13:41:02 +00:00
kr.angelov
8cf03bc5b6
a major redesign in the C runtime. The parser and the linearizer now fully support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode
2013-10-09 12:08:51 +00:00
kr.angelov
ebb5737c0e
fix the robust parser after the change of GuString
2013-10-08 15:00:42 +00:00
kr.angelov
e8335806af
GuString is now an ordinary C string - it makes live easier. In addition PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use.
2013-10-04 12:04:39 +00:00
kr.angelov
13822c9a2d
better handling for nonExist in the C runtime. BIND is also supported in the linearizer but not in the parser yet
2013-09-30 10:25:39 +00:00
kr.angelov
426bc49a52
a major refactoring in the C and the Haskell runtimes. Note incompatible change in the PGF format!!!
...
The following are the outcomes:
- Predef.nonExist is fully supported by both the Haskell and the C runtimes
- Predef.BIND is now an internal compiler defined token. For now
it behaves just as usual for the Haskell runtime, i.e. it generates &+.
However, the special treatment will let us to handle it properly in
the C runtime.
- This required a major change in the PGF format since both
nonExist and BIND may appear inside 'pre' and this was not supported
before.
2013-09-27 15:09:48 +00:00
kr.angelov
2e2f74741a
fix the debug mode of the parser after the refactoring in libgu
2013-09-25 10:21:35 +00:00
kr.angelov
2a49e4e1d6
a major refactoring in the C runtime. GuList is now removed and replaced with GuSeq. The GuSeq/GuBuf API is simplified
2013-09-17 12:45:00 +00:00
kr.angelov
470eb46e96
remove leftcorner_cat_idx which is now redundant
2013-09-13 13:49:17 +00:00
kr.angelov
c721c5548e
minor optimization/refactoring in the grammar reader
2013-09-13 11:02:17 +00:00
kr.angelov
df91908e63
the leftcorner indexing is now completely removed since it slowed down the loading without speeding up parsing a lot
2013-09-13 10:26:33 +00:00
kr.angelov
4eb9aa3911
fix the debug mode of the parser after the changes in the libgu API
2013-09-13 09:58:20 +00:00
kr.angelov
9c3dd1e1e1
remove the logging from libgu
2013-09-12 09:30:02 +00:00
kr.angelov
7c0bad5092
remove the read and write modules from libgu. this simplifies the i/o layer
2013-09-05 11:20:39 +00:00
kr.angelov
805f95eac6
remove the dependency on the HAVE_STATEMENT_EXPRESSIONS flag. This reduces the dependency on the ./configure script
2013-09-04 10:06:07 +00:00
kr.angelov
a20cd77d25
nonExist now does the expected thing
2013-08-23 13:17:45 +00:00
kr.angelov
fa32a6290e
fix in the C parser
2013-08-21 13:09:21 +00:00
kr.angelov
d1368c3519
word completion in the C runtime now returns multi-word expressions and the category for every expression
2013-08-19 15:34:19 +00:00
kr.angelov
e9eeefa6f0
fullFormLexicon in C and Python
2013-08-19 12:16:30 +00:00
kr.angelov
87e34b11dc
implemented lookupMorpho for C and Python
2013-08-16 15:02:24 +00:00
kr.angelov
8f2032a07d
the parser in the C runtime now checks for duplicated results
2013-07-03 12:30:30 +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
3c2d1890d0
patch for adjustable heuristics from Python
2013-06-26 07:36:03 +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
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
