1
0
forked from GitHub/gf-core
Commit Graph

30 Commits

Author SHA1 Message Date
bringert
ca8efaf3c7 Some clean-up in finite-state network generation: MFA now keeps track of start lattice name, instead of having a wrapper lattice. Replaced MFALabel with Symbol. 2007-06-25 16:25:58 +00:00
bringert
23d1917b0d Removed some unused imports of GF.Speech.SRG. 2007-06-21 12:52:59 +00:00
bringert
028f2e108e Changed all SRG printer to take Options and StateGrammar arguments. This makes Custom a lot cleaner. 2007-01-05 15:38:47 +00:00
bringert
9af5b77102 Change input to the different SRG printers to be StateGrammar instead of CGrammar. This to allow looking at the types in SISR, and to reduce the number of argument passed from Custom. 2007-01-05 14:34:20 +00:00
bringert
0fef8d5675 The SLF removeTrivialEmptyNodes optimization could orphan the final node. Fixed this by not bypassing final nodes. 2006-04-12 23:22:35 +00:00
bringert
6370fbfec5 Use cat and language in ATK si. Support language switching with ATK. 2006-01-17 02:13:57 +00:00
bringert
ededda152b Generate monolithic FAs by expanding an MFA. 2006-01-05 20:35:22 +00:00
bringert
e76e2e754a Added monolithic SLF builind back in. 2006-01-05 19:34:12 +00:00
bringert
795078eece Sort sub-networks topologically. HTK's HBuild seems to require this. 2006-01-05 19:03:31 +00:00
bringert
af905434a2 Remove unused sub-networks when generating multiple FAs. 2006-01-05 17:46:30 +00:00
bringert
0603e75a14 Refactored Graph module. Remove some unneccessary states in slf networks. 2006-01-05 16:35:04 +00:00
bringert
3360bd3e7b Print slf_graphviz with subgraphs. 2006-01-05 12:59:36 +00:00
bringert
718b6a5fd2 Build SLF networks with sublattices. 2006-01-04 21:41:12 +00:00
bringert
5d61388d77 Don't import toLower in PrSLF. 2005-12-20 15:17:43 +00:00
bringert
18a57aa56a Added semi-working speech_input command. 2005-12-13 21:03:56 +00:00
bringert
bb545d2faa Use tags in SLF generation to get out a parsable string. 2005-12-09 13:35:50 +00:00
bringert
a35dbbeeb8 SLF generation: make sure that there is only one final node, and that it is actually final. 2005-12-08 16:01:13 +00:00
bringert
f59a16876a Make words in SLF language models upper case. 2005-12-02 12:55:24 +00:00
bringert
09a705d192 Prepared for generation of finite automata in C. 2005-11-10 15:43:44 +00:00
bringert
58de474214 Moved FA and regular grammar printers to a separate module. 2005-11-10 13:19:33 +00:00
bringert
0916a479d8 Parametrized the type of FAs over the state type. 2005-09-14 15:08:35 +00:00
bringert
ac8ef799de Added Graphviz module for graphviz stuff. Move a lot of utility functions to GF.Data.Utilities. 2005-09-14 14:17:29 +00:00
bringert
cb533a4941 Fixed makeTransitions/mapTransitions typo in PrSLF. 2005-09-13 07:20:20 +00:00
bringert
775dff9e2b Cleaned up some stuff while trying to find a bug. Turned out I just had not set the startcat in the grammar file. Time to go home I think. 2005-09-12 21:32:24 +00:00
bringert
fea451f06c Used home-grown graph implementation in FiniteState, to remove dependency on fgl. This also lead to a dramatic performance increase. 2005-09-12 20:41:19 +00:00
bringert
9112e13c60 Added printer for regular grammars. Changed some foldrs to foldls to improve stack usage. 2005-09-12 15:10:23 +00:00
bringert
8c616b8113 Completed unoptimized SLF generation. 2005-09-12 14:46:44 +00:00
bringert
a134b2b6f8 Added the prerequisits for automaton building. 2005-09-07 13:21:30 +00:00
bringert
e191e0513e Some baby stpes closes to ATK SLF generation. 2005-09-02 14:47:46 +00:00
bringert
6220d484a8 Added beginnings of ATK SLF generation. 2005-06-17 11:46:04 +00:00