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 |
|
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
|
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
|
1f91928606
|
now the web service to the robust parser can to translations also
|
2013-04-05 12:22:52 +00:00 |
|
kr.angelov
|
9e741cfe30
|
a bugfix which was causing an infinite loop in the C linearizer for some sentences
|
2013-04-05 09:11:24 +00:00 |
|
kr.angelov
|
a449a240de
|
a very simple linearization for partial abstract trees in the C runtime
|
2013-04-05 08:42:56 +00:00 |
|
kr.angelov
|
c6e4db8f4a
|
the calculation of lexical_prob in the statistical parser doesn't work properly. It should be fixed but for now I just disabled the optimization
|
2013-03-20 12:28:52 +00:00 |
|
kr.angelov
|
2aacbb0c46
|
replace #if with #ifdef when checking for the optional bottom up filtering in the C runtime
|
2013-03-20 10:47:47 +00:00 |
|
kr.angelov
|
770b1af6d9
|
the bottom up filtering in the C runtime is temporary disabled. It takes too much memory and even makes it impossible to load the Finnish and the German parsing grammars.
|
2013-03-19 10:59:44 +00:00 |
|
kr.angelov
|
411d91d410
|
bug fix in the linearizer in the C runtime
|
2013-03-14 12:31:49 +00:00 |
|
kr.angelov
|
d018502fca
|
update the pgf-service tool from the C runtime after the changes in the API
|
2013-03-14 10:37:01 +00:00 |
|
kr.angelov
|
ca3716857c
|
bugfix in the statistical parser
|
2013-03-11 14:47:43 +00:00 |
|
kr.angelov
|
026c198974
|
added gu_buf_flush in seq.c which removes all elements from a buffer
|
2013-02-26 09:48:09 +00:00 |
|
kr.angelov
|
9cb0b580d3
|
the parser in the C runtime should not crash if the start category is not defined
|
2013-02-19 12:08:48 +00:00 |
|
kr.angelov
|
13de2fafb4
|
bugfix in the grammar reader in the C runtime
|
2013-02-19 12:04:10 +00:00 |
|
kr.angelov
|
9940fe392e
|
bugfix in the linearizer for the C runtime
|
2013-02-13 15:39:01 +00:00 |
|
kr.angelov
|
4922ab6cc4
|
now the beam size for the statistical parser can be configured by using the flag beam_size in the top-level concrete module
|
2013-02-12 10:53:13 +00:00 |
|
kr.angelov
|
a4c9d20fc3
|
the statistical parser now uses a baseline lexical estimation of the beam size
|
2013-02-12 09:41:32 +00:00 |
|
kr.angelov
|
6a36ce77ff
|
the class PgfConcr from the Python binding now has a property name which returns the name of the concrete syntax
|
2013-02-11 15:51:26 +00:00 |
|
kr.angelov
|
d124fa9a12
|
refactoring: now all named objects in the C runtime have an explicit name field
|
2013-02-11 14:10:54 +00:00 |
|
kr.angelov
|
90c3304147
|
remove the pgf2yaml tool which was both broken and redundant. The declarations for generic programming from data.c are removed as well
|
2013-02-11 13:51:12 +00:00 |
|
kr.angelov
|
10ef298fa0
|
the grammar reader in the C runtime is completely rewritten and it doesn't use the generic programming API
|
2013-02-11 10:16:58 +00:00 |
|
kr.angelov
|
5e2474e346
|
This patch removes Gregoire's parse_tokens function in the python binding 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
|
2013-02-01 09:29:43 +00:00 |
|
kr.angelov
|
c99ab058ea
|
implement gu_exn_caught in gu/exn.c. It was missing
|
2013-02-01 09:26:30 +00:00 |
|
gregoire.detrez
|
0aae4702ed
|
Python binding: add a parsing function that accepts directly a list of tokens.
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
2013-01-24 13:31:34 +00:00 |
|
kr.angelov
|
580e443a5e
|
fix warnings in pgf-parse.c
|
2013-01-08 12:53:49 +00:00 |
|
peter.ljunglof
|
f74155ef6a
|
PGF installation instructions for Mac OSX
|
2013-01-08 10:23:25 +00:00 |
|
peter.ljunglof
|
49022f5849
|
Made meta probs an optional argument instead of hard-coded in pgf-translate
|
2013-01-08 10:20:46 +00:00 |
|
peter.ljunglof
|
599b51830f
|
New PGF utility: pgf-parse
|
2013-01-08 10:19:53 +00:00 |
|
kr.angelov
|
2c169406fc
|
a new reasoner in the C runtime. It supports tabling which makes it decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
2013-01-07 12:50:32 +00:00 |
|
kr.angelov
|
cade578d04
|
bugfix in the strings library from the C runtime
|
2012-12-27 21:18:46 +00:00 |
|
kr.angelov
|
75696808a7
|
bugfix: the linearizer should not generate extra space at the end of the sentence
|
2012-12-19 11:18:34 +00:00 |
|
kr.angelov
|
87360ccc34
|
bugfix for linearization of metavariables at the root of a tree
|
2012-12-19 10:03:05 +00:00 |
|
kr.angelov
|
a28ccc965c
|
rename linearize.{h/c} to linearizer.{h/c} which follows the convention used in parser.c and reasoner.c
|
2012-12-19 09:17:24 +00:00 |
|
kr.angelov
|
490a3f2286
|
a major reimplementation of the linearizer in the C runtime
|
2012-12-19 09:07:05 +00:00 |
|
kr.angelov
|
ff49d21d13
|
fixed accidental bug in pgf-parse.c
|
2012-12-18 15:42:04 +00:00 |
|
kr.angelov
|
403420be2b
|
the C runtime now can read abstract expressions with literals and meta variables
|
2012-12-18 12:29:30 +00:00 |
|
kr.angelov
|
d12c604f9a
|
debugging infrastructure in the reasoner
|
2012-12-14 21:25:00 +00:00 |
|
kr.angelov
|
16a2c38f38
|
bugfix for the reasoner in the C runtime
|
2012-12-14 21:24:17 +00:00 |
|
kr.angelov
|
20aaa4a989
|
The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python
|
2012-12-14 15:32:49 +00:00 |
|
kr.angelov
|
f7a5eb0df1
|
bugfix in the lexer from the C runtime. the input sentence doesn't have to terminate with whitespace
|
2012-12-13 16:45:44 +00:00 |
|
kr.angelov
|
14e721dda9
|
a top-level API for parsing in the C runtime
|
2012-12-13 14:44:33 +00:00 |
|
kr.angelov
|
68249a11d2
|
bugfix: the outside probability of a PgfItemConts must always be initialized to zero
|
2012-12-13 11:11:45 +00:00 |
|
kr.angelov
|
2dc8236170
|
bugfix: pgf_read_expr no longer requires a semicolon at the end of an abstract expression
|
2012-12-13 11:09:26 +00:00 |
|
kr.angelov
|
aa13090b66
|
started an official API to the C runtime
|
2012-12-12 11:25:58 +00:00 |
|