summaryrefslogtreecommitdiff
path: root/src/GF/Speech/CFGToFiniteState.hs
AgeCommit message (Collapse)Author
2008-06-25removed src for 2.9aarne
2007-06-27bottom-up and top-down filtering do not need fix point iteration.bringert
2007-06-26Oops, I had managed to remove the preprocessing step in makeSimpleRegular, ↵bringert
which broke SLF and non-rec SRGS generation for grammars which need bottom-up filtering.
2007-06-25Some clean-up in finite-state network generation: MFA now keeps track of ↵bringert
start lattice name, instead of having a wrapper lattice. Replaced MFALabel with Symbol.
2007-06-25Some refactorings needed for recursion removal.bringert
2007-06-21Added makeSRG.bringert
2007-06-20Added regexps grammar printer. This is a first step towards recursion-free SRGS.bringert
2007-03-20Remove removeIdenticalRules, since it would get rid of alternative parse ↵bringert
results.
2007-03-20Do the same initial transformations as for CFGs when generating FAs: remove ↵bringert
cycles, identical rules and down top-down and bottom-up filtering.
2007-03-20Renamed removeEmptyCats to bottomUpFilter.bringert
2007-01-05Changed all SRG printer to take Options and StateGrammar arguments. This ↵bringert
makes Custom a lot cleaner.
2007-01-05Change input to the different SRG printers to be StateGrammar instead of ↵bringert
CGrammar. This to allow looking at the types in SISR, and to reduce the number of argument passed from Custom.
2007-01-03Updated another reference to "Regular approximation of CFLs: a grammatical view"bringert
2007-01-03Updated reference to regular -> FA conversion.bringert
2006-12-20Use LCLR algorithm for eliminating left-recursion, with lambda terms in SISR ↵bringert
for getting trees right.
2006-12-17Added still unused implementation of Moore's LCLR algorithm for left ↵bringert
recursion elimination. Fixed top category generation for SRG (included LR-elimination-added categories before).
2006-01-20Use right start category names in si command.bringert
2006-01-17Use cat and language in ATK si. Support language switching with ATK.bringert
2006-01-05Generate monolithic FAs by expanding an MFA.bringert
2006-01-05Sort sub-networks topologically. HTK's HBuild seems to require this.bringert
2006-01-05Remove unused sub-networks when generating multiple FAs.bringert
2006-01-04Build SLF networks with sublattices.bringert
2005-12-29Fintie state networks: fixed stack overflow problem with strictness in Graph ↵bringert
and FiniteState. Some clean-up and smaller performance fixes.
2005-12-29Finite state networks: replace some lookup tables with maps. Rewrite closure ↵bringert
for speed.
2005-12-22Some performance improvements in the FA generation.bringert
2005-12-22Some tracing and formatting stuff looking for the the stack overflow problem ↵bringert
in the FA generation.
2005-12-13Added semi-working speech_input command.bringert
2005-11-10Prepared for generation of finite automata in C.bringert
2005-10-26Moved Graph and Relation stuff to separate modules. Added some QuickCheck ↵bringert
properties for Relation. Improved relation datastructure and algorithms, making FA generation much faster.
2005-09-14Parametrized the type of FAs over the state type.bringert
2005-09-14Added Graphviz module for graphviz stuff. Move a lot of utility functions to ↵bringert
GF.Data.Utilities.
2005-09-12Added printer for regular grammars. Changed some foldrs to foldls to improve ↵bringert
stack usage.
2005-09-12Completed unoptimized SLF generation.bringert