30 Commits

Author	SHA1	Message	Date
bringert	862c780f78	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	2b63a89569	Some refactorings needed for recursion removal.	2007-06-25 13:38:40 +00:00
bringert	16bfb1250b	Added makeSRG.	2007-06-21 13:40:13 +00:00
bringert	6968004f19	Added regexps grammar printer. This is a first step towards recursion-free SRGS.	2007-06-20 16:08:23 +00:00
bringert	7ae2e01678	Remove removeIdenticalRules, since it would get rid of alternative parse results.	2007-03-20 22:09:17 +00:00
bringert	00e681aee8	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	a8d356d599	Renamed removeEmptyCats to bottomUpFilter.	2007-03-20 21:15:59 +00:00
bringert	6ee7296f9d	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	741dde5a2a	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	bf8b078a7a	Updated another reference to "Regular approximation of CFLs: a grammatical view"	2007-01-03 18:28:25 +00:00
bringert	b1cde222bf	Updated reference to regular -> FA conversion.	2007-01-03 18:17:32 +00:00
bringert	f9621483a0	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	c7df9f4167	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	92f22c8f5c	Use right start category names in si command.	2006-01-20 18:20:02 +00:00
bringert	d4d89c72f3	Use cat and language in ATK si. Support language switching with ATK.	2006-01-17 02:13:57 +00:00
bringert	dc3f7e1d61	Generate monolithic FAs by expanding an MFA.	2006-01-05 20:35:22 +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	a4ba93cc55	Build SLF networks with sublattices.	2006-01-04 21:41:12 +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	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
bringert	5a480fac52	Added semi-working speech_input command.	2005-12-13 21:03:56 +00:00
bringert	136728e336	Prepared for generation of finite automata in C.	2005-11-10 15:43:44 +00:00
bringert	3d4200d3fe	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	b109bcaafa	Parametrized the type of FAs over the state type.	2005-09-14 15:08:35 +00:00
bringert	a8bc5590af	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	01ef25792c	Added printer for regular grammars. Changed some foldrs to foldls to improve stack usage.	2005-09-12 15:10:23 +00:00
bringert	ddda900d53	Completed unoptimized SLF generation.	2005-09-12 14:46:44 +00:00