kr.angelov
8aefd1e072
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
e1bab39458
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
6bc32db1c3
added simple error handling in the Python test
2012-12-13 16:44:39 +00:00
kr.angelov
81428c768c
added a simple test for the Python binding
2012-12-13 16:19:56 +00:00
kr.angelov
cc7ea9260b
an initial API for parsing and linearization from Python
2012-12-13 15:39:07 +00:00
kr.angelov
2ba632dc9f
a top-level API for parsing in the C runtime
2012-12-13 14:44:33 +00:00
kr.angelov
60942c440a
bugfix: the outside probability of a PgfItemConts must always be initialized to zero
2012-12-13 11:11:45 +00:00
kr.angelov
fe51a7fb98
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
162fd5e512
an initial Python binding to the C runtime
2012-12-12 11:29:39 +00:00
kr.angelov
1376df457d
started an official API to the C runtime
2012-12-12 11:25:58 +00:00
kr.angelov
3182e382dc
bugfix for robust parsing with multi-word units
2012-12-11 12:57:22 +00:00
kr.angelov
1863e4c3d6
added experimental script for chunking in the C runtime
2012-12-03 10:07:54 +00:00
kr.angelov
2da23e9872
added INSTALL file and updated README file for the C runtime
2012-12-03 09:09:08 +00:00
hallgren
78a2a90903
PGFService.hs: fix type error caused by change to PGF.graphvizParseTree
...
Note that some of the graphviz functions have backwards incompatible changes
that might also affect other clients of the PGF run-time library.
Also added graphvizDefaults and export it together with GraphvizOptions from
the PGF run-time library.
2012-11-22 15:27:16 +00:00
peter.ljunglof
595c475c70
better visualization of parse trees
2012-11-22 08:50:37 +00:00
peter.ljunglof
1789272c9a
Added C compilation notes for Mac OSX
2012-11-22 08:50:49 +00:00
kr.angelov
f8c302f9ef
remove the duplicated definition of PgfProductionIdx in parser.c
2012-11-19 14:16:31 +00:00
kr.angelov
71b7c09ffe
bugfix for the building of bottom-up filter in the C runtime
2012-11-16 13:27:15 +00:00
kr.angelov
a3ba1991f4
revised heuristic in the statistical parser
2012-11-14 12:34:22 +00:00
kr.angelov
70c68f0527
bugfix in the statistical parser
2012-11-13 09:48:23 +00:00
kr.angelov
08ee662944
two simple heuristics which speed up the statistical parser more than seven times.
2012-11-12 22:17:40 +00:00
kr.angelov
68170d5b08
a simple refactoring in the statistical parser
2012-11-12 21:48:22 +00:00
kr.angelov
a2771552d6
more counters in the profiler for the statistical parser
2012-11-12 15:36:21 +00:00
kr.angelov
46de62c452
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
9967c3ad04
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
9d23093492
small refactoring in the C runtime
2012-11-12 13:05:35 +00:00
kr.angelov
a50c7c24b8
use size_t consistently as the type for constituent indices in the C runtime
2012-11-12 12:51:27 +00:00
kr.angelov
1e531e8237
implemented gu_map_count in runtime/c/gu/map.c
2012-11-12 12:42:19 +00:00
kr.angelov
52255664be
use prob_t instead of float in a few places
2012-10-29 08:52:56 +00:00
kr.angelov
0ad2405d69
forgot to add one #ifdef
2012-10-25 18:37:22 +00:00
kr.angelov
9721833680
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
28b58b6267
add teyjus/simulator/builtins/builtins.h
2012-10-11 11:10:17 +00:00
kr.angelov
f0583bfd93
added the forgoten libteyjus.pc.in file in the C runtime
2012-10-11 04:22:38 +00:00
kr.angelov
18fe8af964
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
bb15542a85
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
f75d1374ff
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
44df7a33cf
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
cd3cca4aa2
bugfix in the C parser
2012-09-06 14:52:19 +00:00
kr.angelov
37e1ced6cf
another fix for teyjus
2012-08-30 08:09:30 +00:00
kr.angelov
fe27540c49
the loading of PGF files was broken by the Teyjus patch. Now this is fixed
2012-08-30 07:41:49 +00:00
peter.ljunglof
f78505d88e
Use nub' instead of nub in some places, remove some unused nub imports
2012-08-29 21:48:34 +00:00
peter.ljunglof
87260365c7
Added an O(n log n) version of nub
...
The new nub is called nub', and it replaces the old sortNub which was
not lazy and did not retain the order between the elements.
2012-08-29 21:45:10 +00:00
kr.angelov
fd5220038d
A basic infrastructure for generating Teyjus bytecode from the GF abstract syntax
2012-08-29 11:43:02 +00:00
kr.angelov
3ef3108314
fix some warnings in teyjus
2012-08-03 12:30:01 +00:00
kr.angelov
b34232c6dc
the first draft of GF.Compile.Instructions
2012-08-01 09:21:59 +00:00
kr.angelov
2844742afd
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
3a352a953f
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
7549a4876d
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
b765b0c054
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
aarne
8ef8af479f
command option ma -known to drop unknown words
2012-06-10 10:43:57 +00:00
