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
|
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
|
87360ccc34
|
bugfix for linearization of metavariables at the root of a tree
|
2012-12-19 10:03:05 +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
|
68249a11d2
|
bugfix: the outside probability of a PgfItemConts must always be initialized to zero
|
2012-12-13 11:11:45 +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
|
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
|
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
|
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
|
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
|
86b5ec7447
|
bugfix in the C parser
|
2012-09-06 14:52:19 +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
|
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
|
f4c17cb7aa
|
another attempt to port the robust parser to MacOS
|
2012-05-16 15:18:44 +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
|
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
|
e31c883075
|
libpgf: the first prototype for the robust parser
|
2012-02-29 14:43:08 +00:00 |
|
kr.angelov
|
5fa1418194
|
libpgf: another fix in the parser debugger
|
2012-02-28 16:37:12 +00:00 |
|
kr.angelov
|
dcbeb63849
|
libpgf: fix in the parser debugger
|
2012-02-28 13:12:38 +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
|
7ddd0d5f3e
|
libpgf: added index for fast lexicon lookup. Still not perfect
|
2012-02-21 21:17:50 +00:00 |
|
kr.angelov
|
a55a224dce
|
libpgf: now the debugging mode for the parser is available only with compilation option.
|
2012-02-18 19:30:16 +00:00 |
|
kr.angelov
|
47e5e8c966
|
libpgf: now the linearization index is created during the grammar loading which also makes the types PgfLzr and PgfParser redundant.
|
2012-02-18 16:22:40 +00:00 |
|
kr.angelov
|
6f0795d8a3
|
libpgf: switch to using callbacks and lazy prediction in the parser. this reduce the parsing time from 11 sec down to 3 sec.
|
2012-01-26 12:32:26 +00:00 |
|
kr.angelov
|
a2414bc625
|
libpgf: use a temporal pool for allocating the arrays in the continuation map of the parser
|
2012-01-26 09:03:08 +00:00 |
|
kr.angelov
|
5ccd75c8b9
|
libpgf: debugging framework for the parser
|
2012-01-23 15:49:29 +00:00 |
|