summaryrefslogtreecommitdiff
path: root/src/GF/Speech/FiniteState.hs
AgeCommit message (Collapse)Author
2009-12-13reorganize the directories under src, and rescue the JavaScript interpreter ↵krasimir
from deprecated
2008-11-27Move Graph, Relation and Graphviz modules from GF.Speech to GF.Data.bjorn
2008-06-25changed names of resource-1.3; added a note on homepage on releaseaarne
2008-06-25removed src for 2.9aarne
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-03-26Remove all empty SLF nodes, don't care about edge explosion. Empty nodes are ↵bringert
pprobably worse than lots of edges.
2007-03-25Comments only.bringert
2006-12-15Towards smaller SRGs when lots of variants are used.bringert
2006-04-12The SLF removeTrivialEmptyNodes optimization could orphan the final node. ↵bringert
Fixed this by not bypassing final nodes.
2006-01-05Fixed-point iterate unneccessary node removeal.bringert
2006-01-05Generate monolithic FAs by expanding an MFA.bringert
2006-01-05Remove more unneccessary nodes in SLF networks.bringert
2006-01-05Refactored Graph module. Remove some unneccessary states in slf networks.bringert
2006-01-05Print slf_graphviz with subgraphs.bringert
2006-01-04Build SLF networks with sublattices.bringert
2005-12-29Finite state networks: more strictness. alternative (still unused) ↵bringert
implementation of reachable.
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-29Finite state minimization: improved performance by using Set State instead ↵bringert
of [State] as DFA labels.
2005-12-29Finite state network generation: reimplemented getOutgoing using Data.Map to ↵bringert
improve performance of minimize with large networks.
2005-12-22Some performance improvements in the FA generation.bringert
2005-12-08SLF generation: make sure that there is only one final node, and that it is ↵bringert
actually final.
2005-11-10Prepared for generation of finite automata in C.bringert
2005-10-27Reduced complexity of reachable in FA determinization.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-22Added placeholder for minimizing SLF-style automata.bringert
2005-09-22Generated finite state networks are now state minimal.bringert
2005-09-15Fixed some bugs in the Graphviz printer.bringert
2005-09-14Started wotking on NFA to DFA.bringert
2005-09-14Parametrized the type of FAs over the state type.bringert
2005-09-14Parametrized the Graph type over the node type.bringert
2005-09-14Added Graphviz module for graphviz stuff. Move a lot of utility functions to ↵bringert
GF.Data.Utilities.
2005-09-12Cleaned up some stuff while trying to find a bug. Turned out I just had not ↵bringert
set the startcat in the grammar file. Time to go home I think.
2005-09-12Some preparations for graph minimization.bringert
2005-09-12Used home-grown graph implementation in FiniteState, to remove dependency on ↵bringert
fgl. This also lead to a dramatic performance increase.
2005-09-12Completed unoptimized SLF generation.bringert
2005-09-08Defined compileAutomaton in terms of make_fabringert
2005-09-07Added the prerequisits for automaton building.bringert