1
0
forked from GitHub/gf-core
Commit Graph

32 Commits

Author SHA1 Message Date
bringert
f2710ba80d bottom-up and top-down filtering do not need fix point iteration. 2007-06-27 17:46:34 +00:00
bringert
84e030d128 Oops, I had managed to remove the preprocessing step in makeSimpleRegular, which broke SLF and non-rec SRGS generation for grammars which need bottom-up filtering. 2007-06-26 15:09:48 +00:00
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
815cc5a7eb Some refactorings needed for recursion removal. 2007-06-25 13:38:40 +00:00
bringert
8cdbaa39f7 Added makeSRG. 2007-06-21 13:40:13 +00:00
bringert
13b8bab5fe Added regexps grammar printer. This is a first step towards recursion-free SRGS. 2007-06-20 16:08:23 +00:00
bringert
0eac3f6b58 Remove removeIdenticalRules, since it would get rid of alternative parse results. 2007-03-20 22:09:17 +00:00
bringert
fe73354cc6 Do the same initial transformations as for CFGs when generating FAs: remove cycles, identical rules and down top-down and bottom-up filtering. 2007-03-20 22:00:50 +00:00
bringert
a473281c65 Renamed removeEmptyCats to bottomUpFilter. 2007-03-20 21:15: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
3e7b707c69 Updated another reference to "Regular approximation of CFLs: a grammatical view" 2007-01-03 18:28:25 +00:00
bringert
f6a5ea8738 Updated reference to regular -> FA conversion. 2007-01-03 18:17:32 +00:00
bringert
cb70ffadaa Use LCLR algorithm for eliminating left-recursion, with lambda terms in SISR for getting trees right. 2006-12-20 20:10:15 +00:00
bringert
5b8680b8fd Added still unused implementation of Moore's LCLR algorithm for left recursion elimination. Fixed top category generation for SRG (included LR-elimination-added categories before). 2006-12-17 19:18:28 +00:00
bringert
036de8d94e Use right start category names in si command. 2006-01-20 18:20:02 +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
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
718b6a5fd2 Build SLF networks with sublattices. 2006-01-04 21:41:12 +00:00
bringert
79d771ab1d 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
72c2289857 Finite state networks: replace some lookup tables with maps. Rewrite closure for speed. 2005-12-29 16:29:21 +00:00
bringert
5c12a73dae Some performance improvements in the FA generation. 2005-12-22 23:16:15 +00:00
bringert
cb9769788e Some tracing and formatting stuff looking for the the stack overflow problem in the FA generation. 2005-12-22 18:04:05 +00:00
bringert
18a57aa56a Added semi-working speech_input command. 2005-12-13 21:03:56 +00:00
bringert
09a705d192 Prepared for generation of finite automata in C. 2005-11-10 15:43:44 +00:00
bringert
b7609f09a5 Moved Graph and Relation stuff to separate modules. Added some QuickCheck properties for Relation. Improved relation datastructure and algorithms, making FA generation much faster. 2005-10-26 16:13:13 +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
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