 kr.angelov
|
84fa796de4
|
bugfix in the reference counting for Python
|
2013-01-29 09:41:12 +00:00 |
|
|
kr.angelov
|
05cb74d14a
|
the Python binding is in pure C again
|
2013-01-29 09:20:32 +00:00 |
|
|
kr.angelov
|
b524c5d8b5
|
added an API for composing and decomposing abstract trees from Python
|
2013-01-29 09:07:41 +00:00 |
|
|
kr.angelov
|
8846648393
|
fixed typos in the python binding: in a few places pgf_ExprType was used instead of pgf_ExprIterType
|
2013-01-29 09:06:23 +00:00 |
|
|
kr.angelov
|
580e443a5e
|
fix warnings in pgf-parse.c
|
2013-01-08 12:53:49 +00:00 |
|
|
kr.angelov
|
9b78da5357
|
now the Python binding has an alternative representation for abstract trees which is composed of Python objects. The new representation is not integrated with the core runtime yet
|
2013-01-07 15:11:12 +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
|
8ec7ecacca
|
a bit more flexible API for parsing in Python
|
2012-12-14 16:00:52 +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
|
0f0b7158c9
|
added simple error handling in the Python test
|
2012-12-13 16:44:39 +00:00 |
|
|
kr.angelov
|
75c544027b
|
added a simple test for the Python binding
|
2012-12-13 16:19:56 +00:00 |
|
|
kr.angelov
|
836b953b9d
|
an initial API for parsing and linearization from Python
|
2012-12-13 15:39:07 +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
|
0891ef3f0f
|
an initial Python binding to the C runtime
|
2012-12-12 11:29:39 +00:00 |
|
|
kr.angelov
|
aa13090b66
|
started an official API to the C runtime
|
2012-12-12 11:25:58 +00:00 |
|
|
kr.angelov
|
5779887f96
|
bugfix for robust parsing with multi-word units
|
2012-12-11 12:57:22 +00:00 |
|
|
kr.angelov
|
e174f37940
|
added experimental script for chunking in the C runtime
|
2012-12-03 10:07:54 +00:00 |
|
|
kr.angelov
|
6e3321d712
|
added INSTALL file and updated README file for the C runtime
|
2012-12-03 09:09:08 +00:00 |
|
|
kr.angelov
|
5e3b23325e
|
remove the duplicated definition of PgfProductionIdx in parser.c
|
2012-11-19 14:16:31 +00:00 |
|
|
kr.angelov
|
954d7a7ff5
|
bugfix for the building of bottom-up filter in the C runtime
|
2012-11-16 13:27:15 +00:00 |
|
|
kr.angelov
|
5c52eaf0b7
|
revised heuristic in the statistical parser
|
2012-11-14 12:34:22 +00:00 |
|
|
kr.angelov
|
468464faca
|
bugfix in the statistical parser
|
2012-11-13 09:48:23 +00:00 |
|
|
kr.angelov
|
d1044b202a
|
two simple heuristics which speed up the statistical parser more than seven times.
|
2012-11-12 22:17:40 +00:00 |
|
|
kr.angelov
|
182e366f5d
|
a simple refactoring in the statistical parser
|
2012-11-12 21:48:22 +00:00 |
|
|
kr.angelov
|
7ad4436502
|
more counters in the profiler for the statistical parser
|
2012-11-12 15:36:21 +00:00 |
|
|
kr.angelov
|
9b2487243e
|
now we store the state instead of the offset for every continuation in the chart for the statistical parser
|
2012-11-12 14:04:52 +00:00 |
|
|
kr.angelov
|
c28056c4e5
|
in the statistical parser: move the outside probability from the parse items to their continuation. this makes the value slot shared between many items
|
2012-11-12 13:43:43 +00:00 |
|
|
kr.angelov
|
56f3ff8202
|
small refactoring in the C runtime
|
2012-11-12 13:05:35 +00:00 |
|
|
kr.angelov
|
cce22a7f7a
|
use size_t consistently as the type for constituent indices in the C runtime
|
2012-11-12 12:51:27 +00:00 |
|
|
kr.angelov
|
6784a4c76e
|
implemented gu_map_count in runtime/c/gu/map.c
|
2012-11-12 12:42:19 +00:00 |
|
|
kr.angelov
|
c679b08b38
|
use prob_t instead of float in a few places
|
2012-10-29 08:52:56 +00:00 |
|
|
kr.angelov
|
118333eee8
|
forgot to add one #ifdef
|
2012-10-25 18:37:22 +00:00 |
|
|
kr.angelov
|
d185938952
|
a major refactoring in the robust parser: bottom-up filtering and garbage collection for the chart
|
2012-10-25 14:42:53 +00:00 |
|
|
kr.angelov
|
93e3356d02
|
add teyjus/simulator/builtins/builtins.h
|
2012-10-11 11:10:17 +00:00 |
|
|
kr.angelov
|
b22075e15a
|
added the forgoten libteyjus.pc.in file in the C runtime
|
2012-10-11 04:22:38 +00:00 |
|
|
kr.angelov
|
6e3503bb7b
|
move examples/PennTreebank to /treebanks/PennTreebank
|
2012-10-01 08:52:54 +00:00 |
|
|
kr.angelov
|
de679b400a
|
typechecking and better error reporting in the training script for PennTreebank
|
2012-10-01 08:45:46 +00:00 |
|
|
kr.angelov
|
6daeecb6d9
|
added the GF version of Talbanken which was imported by Malin
|
2012-10-01 08:33:43 +00:00 |
|
|
kr.angelov
|
bf49f3c246
|
now the meta probability for a category is explicitly specified in the statistical model instead of computed internally. this avoids rounding errors while computing the sum of a large number of small values.
|
2012-09-24 09:37:21 +00:00 |
|
|
kr.angelov
|
8b28b89ffc
|
in the robust parser we don't have to care about trees which yeld empty strings. this makes the parser a lot faster
|
2012-09-24 09:30:20 +00:00 |
|
|
kr.angelov
|
fe3b5c1360
|
the Haskell runtime now exports 'functionsByCat' which returns the list of all functions for a given category
|
2012-09-18 09:48:21 +00:00 |
|
|
kr.angelov
|
a307ed6c75
|
the C runtime now has a type prob_t which is used only for probability values
|
2012-09-18 09:18:48 +00:00 |
|
|
kr.angelov
|
91ca7c9a1b
|
catch all case in GenerateBC.genFun
|
2012-09-18 08:32:21 +00:00 |
|
|
kr.angelov
|
a34e9482e7
|
The training script for the PennTreebank is updated to compute more statistics
|
2012-09-07 08:18:11 +00:00 |
|
|
kr.angelov
|
86b5ec7447
|
bugfix in the C parser
|
2012-09-06 14:52:19 +00:00 |
|
|
kr.angelov
|
545e48e881
|
another fix for teyjus
|
2012-08-30 08:09:30 +00:00 |
|
|
kr.angelov
|
3f0b8c55ec
|
the loading of PGF files was broken by the Teyjus patch. Now this is fixed
|
2012-08-30 07:41:49 +00:00 |
|
|
kr.angelov
|
f8fe23fda7
|
A basic infrastructure for generating Teyjus bytecode from the GF abstract syntax
|
2012-08-29 11:43:02 +00:00 |
|
|
kr.angelov
|
3601b796e5
|
fix some warnings in teyjus
|
2012-08-03 12:30:01 +00:00 |
|
|
kr.angelov
|
9fc7cac46f
|
the first draft of GF.Compile.Instructions
|
2012-08-01 09:21:59 +00:00 |
|
|
kr.angelov
|
83b321d862
|
An initial import of the teyjus source code in the C runtime for GF. The two runtime are still not connected but the source code compiles.
|
2012-07-31 15:16:04 +00:00 |
|
|
kr.angelov
|
3ad5493758
|
Use a separated tag for meta productions in the robust parser. This cleans up the code a lot
|
2012-06-13 05:49:30 +00:00 |
|
|
kr.angelov
|
c9c5675e1d
|
now there is a limit of 2000000 items in the chart of the robust parser. This prevents from explosion in the memory size but it will also prevent us from parsing some sentences.
|
2012-06-12 11:30:01 +00:00 |
|
|
kr.angelov
|
808c52744f
|
improved script for training from PennTreebank
|
2012-06-12 10:05:17 +00:00 |
|
|
kr.angelov
|
b27a440ef3
|
now the robust parser is purely top-down and the meta rules compete on a fair basis with the grammar rules
|
2012-06-12 09:29:51 +00:00 |
|
|
kr.angelov
|
06f9965d27
|
the viterbi probability for the epsilon categories is now updated properly
|
2012-05-25 07:30:35 +00:00 |
|
|
kr.angelov
|
ea5fe32d89
|
fixed an alignment bug in libgu which leads to crash on some platforms
|
2012-05-25 07:29:29 +00:00 |
|
|
kr.angelov
|
92488a6592
|
fixed memory leak in the pgf-translate tool
|
2012-05-25 07:28:18 +00:00 |
|
|
kr.angelov
|
5312ef23c6
|
added pgf-service.c in the robust parser'
|
2012-05-25 07:27:29 +00:00 |
|
|
kr.angelov
|
f4c17cb7aa
|
another attempt to port the robust parser to MacOS
|
2012-05-16 15:18:44 +00:00 |
|
|
kr.angelov
|
d2e528c7f4
|
small fix for compiling the robust parser on MacOS
|
2012-05-16 12:18:50 +00:00 |
|
|
kr.angelov
|
a6800fc0da
|
a new unbiased statistical parser. it is still far from perfect use it on your own risk.
|
2012-05-08 12:13:28 +00:00 |
|
|
kr.angelov
|
931066f6fc
|
yet another fix for parsing literals
|
2012-04-18 15:50:55 +00:00 |
|
|
kr.angelov
|
17bc8e5c89
|
some fixes in the robust parser and a new API for literals
|
2012-04-12 06:55:25 +00:00 |
|
|
kr.angelov
|
6644d93ec2
|
simple cleanup in the robust parser
|
2012-04-02 19:01:18 +00:00 |
|
|
kr.angelov
|
230f309317
|
libpgf: a new implementation for literals which also allows custom literals. the same mechanism is now used for the metavariables
|
2012-03-12 14:25:51 +00:00 |
|
|
kr.angelov
|
1726995921
|
libpgf: added simple lexer
|
2012-03-09 09:14:44 +00:00 |
|
|
kr.angelov
|
ed5de8335b
|
libpgf: implementation for built in literal categories
|
2012-03-07 16:39:29 +00:00 |
|
|
kr.angelov
|
96493c274b
|
libpgf: simple fix in the parser debugger
|
2012-03-07 12:23:07 +00:00 |
|
|
kr.angelov
|
a96da30489
|
libpgf: two APIs - one for finding all parse results and another for finding the best parse result
|
2012-03-07 11:00:17 +00:00 |
|
|
kr.angelov
|
0e90d1ba1f
|
libpgf: now all concrete functions and categories are explicitly linked to their abstract counter parts
|
2012-03-05 12:59:31 +00:00 |
|
|
kr.angelov
|
4d1b0859d0
|
libpgf: preliminary version for the statistical ranking. we use naive statistical model with random weight for the meta variables.
|
2012-03-02 19:25:01 +00:00 |
|
|
kr.angelov
|
58b6bbd242
|
libpgf: simple optimization in the implementation for heaps
|
2012-03-02 17:43:46 +00:00 |
|
|
kr.angelov
|
2775faad7a
|
libpgf: an API for building heaps from buffers in gu/seq.c
|
2012-02-29 18:51:21 +00:00 |
|
|
kr.angelov
|
e31c883075
|
libpgf: the first prototype for the robust parser
|
2012-02-29 14:43:08 +00:00 |
|
|
kr.angelov
|
b054549082
|
libpgf: the choice object should remember integers instead of single bytes
|
2012-02-29 13:41:59 +00:00 |
|
|
kr.angelov
|
5fa1418194
|
libpgf: another fix in the parser debugger
|
2012-02-28 16:37:12 +00:00 |
|
|
kr.angelov
|
4ddf24429b
|
libpgf: the time measurement in pgf-translate should be made after pgf_parse_result for more accurate timing
|
2012-02-28 13:14:24 +00:00 |
|
|
kr.angelov
|
dcbeb63849
|
libpgf: fix in the parser debugger
|
2012-02-28 13:12:38 +00:00 |
|
|
kr.angelov
|
eb4bfb008e
|
buf fix in the compiler for HOAS
|
2012-02-28 08:10:47 +00:00 |
|
|
kr.angelov
|
686fcca9a4
|
libpgf: pretty printing for expressions with metavaraibles
|
2012-02-27 13:50:35 +00:00 |
|
|
kr.angelov
|
667ca8e5f7
|
libpgf: fix in pgf_read_into_map
|
2012-02-24 15:15:07 +00:00 |
|
|
kr.angelov
|
1d239ab567
|
libpgf: simple fix in the grammar printer and the reader
|
2012-02-24 13:52:21 +00:00 |
|
|
kr.angelov
|
b99fa6aa9a
|
libpgf: now we have both complete bottom up index for robust parsing and fast lexical lookup from the same index
|
2012-02-22 21:27:54 +00:00 |
|
|
kr.angelov
|
42410f80d2
|
libpgf: two small fixes in the parser debugger
|
2012-02-22 14:06:49 +00:00 |
|
|
kr.angelov
|
786bf883b7
|
libpgf: the map curr_lindefs must be allocated from a temporary pool
|
2012-02-22 08:49:08 +00:00 |
|
|
kr.angelov
|
7ddd0d5f3e
|
libpgf: added index for fast lexicon lookup. Still not perfect
|
2012-02-21 21:17:50 +00:00 |
|
|
kr.angelov
|
a178608f37
|
utils/pgf-translate now reports the parsing time
|
2012-02-21 20:17:18 +00:00 |
|