 aarne
|
f916352116
|
testing treebanks
|
2006-02-08 21:58:36 +00:00 |
|
|
aarne
|
c9ae662c24
|
numeration in treebank
|
2006-02-08 14:05:46 +00:00 |
|
|
aarne
|
98b24d0e33
|
command tb for creating treebanks
|
2006-02-08 10:18:00 +00:00 |
|
|
bringert
|
9bae44c37d
|
Moved general XML stuff to GF.Data.XML. Started working on VoiceXML generation.
|
2006-02-03 18:43:06 +00:00 |
|
|
bringert
|
bdf602b95c
|
SRGS: add top-level rules for each GF category.
|
2006-02-01 19:00:48 +00:00 |
|
|
bringert
|
8cd03874f6
|
Include GF version and compile date in SRGS meta creator tag.
|
2006-02-01 18:09:47 +00:00 |
|
|
bringert
|
a26ccb40bd
|
SRGS semantic results for list categories is now an array.
|
2006-02-01 18:03:13 +00:00 |
|
|
bringert
|
fd0dfd7d4d
|
First version of SRGS with semantic tags.
|
2006-02-01 16:23:14 +00:00 |
|
|
bringert
|
992e212bcc
|
Escape backslashes and double quotes in SRGS attribute values.
|
2006-02-01 10:24:37 +00:00 |
|
|
bringert
|
36492443e9
|
Set xml:lang in SRGS grammars to the value of the language flag.
|
2006-02-01 10:16:40 +00:00 |
|
|
aarne
|
e59bad1f19
|
math API; lock field warnings
|
2006-01-31 17:10:31 +00:00 |
|
|
aarne
|
443f86ba4d
|
Norwegian
|
2006-01-26 13:57:22 +00:00 |
|
|
bringert
|
ad65c86860
|
Updated GHC version requirement and file names for GF 2.4.
|
2006-01-26 12:06:24 +00:00 |
|
|
aarne
|
32a0a9ac0f
|
optimization of selection computation
|
2006-01-24 20:36:37 +00:00 |
|
|
aarne
|
e8d50c3841
|
the parser can read .gfm files (but they are not yet compiled all the way)
|
2006-01-24 15:18:46 +00:00 |
|
|
bringert
|
92f22c8f5c
|
Use right start category names in si command.
|
2006-01-20 18:20:02 +00:00 |
|
|
bringert
|
0f6c51f741
|
Report errors in at command.
|
2006-01-20 18:18:49 +00:00 |
|
|
aarne
|
c9ed0c4218
|
more french
|
2006-01-20 16:56:38 +00:00 |
|
|
aarne
|
60d7d16906
|
started romance predication; some restructuring of modules; CheckGrammar value table bug fix
|
2006-01-20 10:54:38 +00:00 |
|
|
aarne
|
62105801a1
|
workaround for a compilation bug for param defs (to be fixed)
|
2006-01-19 17:27:46 +00:00 |
|
|
bringert
|
d4d89c72f3
|
Use cat and language in ATK si. Support language switching with ATK.
|
2006-01-17 02:13:57 +00:00 |
|
|
aarne
|
74c5d41152
|
incompleteness warning and PNeg in CheckGrammar
|
2006-01-16 09:47:08 +00:00 |
|
|
aarne
|
90c7caa788
|
type checking pattern bindings
|
2006-01-13 13:47:15 +00:00 |
|
|
peb
|
acd24331af
|
peb
|
2006-01-13 08:42:25 +00:00 |
|
|
aarne
|
7752543f04
|
API documentation and slight change in Det syntax
|
2006-01-10 15:39:20 +00:00 |
|
|
aarne
|
7fbaae3350
|
matching empty string fixed
|
2006-01-09 09:22:39 +00:00 |
|
|
aarne
|
00ea4e3dcd
|
documenting regular patterns
|
2006-01-07 15:42:13 +00:00 |
|
|
aarne
|
d133e0353c
|
regular expression patterns
|
2006-01-07 14:39:40 +00:00 |
|
|
aarne
|
4e42d73ee5
|
regex patterns for tokens
|
2006-01-07 12:26:11 +00:00 |
|
|
aarne
|
88b09b8ae0
|
concatenation string patterns
|
2006-01-06 21:49:25 +00:00 |
|
|
bringert
|
3bf8e5ce6f
|
Fixed-point iterate unneccessary node removeal.
|
2006-01-05 20:55:13 +00:00 |
|
|
bringert
|
dc3f7e1d61
|
Generate monolithic FAs by expanding an MFA.
|
2006-01-05 20:35:22 +00:00 |
|
|
bringert
|
7faaa9772b
|
Added monolithic SLF builind back in.
|
2006-01-05 19:34:12 +00:00 |
|
|
bringert
|
7ee1ba0001
|
Sort sub-networks topologically. HTK's HBuild seems to require this.
|
2006-01-05 19:03:31 +00:00 |
|
|
bringert
|
ca84f92302
|
Remove unused sub-networks when generating multiple FAs.
|
2006-01-05 17:46:30 +00:00 |
|
|
bringert
|
bffc7df07e
|
Remove more unneccessary nodes in SLF networks.
|
2006-01-05 16:48:55 +00:00 |
|
|
bringert
|
12187f684e
|
Refactored Graph module. Remove some unneccessary states in slf networks.
|
2006-01-05 16:35:04 +00:00 |
|
|
bringert
|
a373760ebb
|
Use language flag to select the acoustic model to use with ATK.
|
2006-01-05 16:34:35 +00:00 |
|
|
bringert
|
5c0d9d52b3
|
Print slf_graphviz with subgraphs.
|
2006-01-05 12:59:36 +00:00 |
|
|
bringert
|
a4ba93cc55
|
Build SLF networks with sublattices.
|
2006-01-04 21:41:12 +00:00 |
|
|
bringert
|
e22275d467
|
Regenerate Transfer abstract syntaxes with updated BNFC.
|
2006-01-03 10:29:47 +00:00 |
|
|
bringert
|
14079a9d7c
|
Finite state networks: more strictness. alternative (still unused) implementation of reachable.
|
2005-12-29 21:35:40 +00:00 |
|
|
bringert
|
d854890820
|
Fintie state networks: fixed stack overflow problem with strictness in Graph and FiniteState. Some clean-up and smaller performance fixes.
|
2005-12-29 20:24:34 +00:00 |
|
|
bringert
|
f4f1f04123
|
Finite state networks: replace some lookup tables with maps. Rewrite closure for speed.
|
2005-12-29 16:29:21 +00:00 |
|
|
bringert
|
5ad1ca8827
|
Finite state minimization: improved performance by using Set State instead of [State] as DFA labels.
|
2005-12-29 15:55:48 +00:00 |
|
|
bringert
|
cb5e52bd2e
|
Finite state network generation: reimplemented getOutgoing using Data.Map to improve performance of minimize with large networks.
|
2005-12-29 13:33:58 +00:00 |
|
|
bringert
|
e32472a9bb
|
Some performance improvements in the FA generation.
|
2005-12-22 23:16:15 +00:00 |
|
|
bringert
|
29ba681242
|
Some tracing and formatting stuff looking for the the stack overflow problem in the FA generation.
|
2005-12-22 18:04:05 +00:00 |
|
|
aarne
|
0f85146395
|
nosignal
|
2005-12-22 19:48:17 +00:00 |
|
|
aarne
|
ddc4b8803b
|
newline in welcome
|
2005-12-22 18:27:27 +00:00 |
|