msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

Remove all empty SLF nodes, don't care about edge explosion. Empty nodes are pprobably worse than lots of edges.

Browse Source
This commit is contained in:
bringert
2007-03-26 17:36:58 +00:00
parent 651697982b
commit 896233c4a9
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/GF/Speech/FiniteState.hs
View File

@@ -184,8 +184,7 @@ moveLabelsToNodes = onGraph f
removeTrivialEmptyNodes :: (Eq a, Ord n) => FA n (Maybe a) () -> FA n (Maybe a) () removeTrivialEmptyNodes :: (Eq a, Ord n) => FA n (Maybe a) () -> FA n (Maybe a) ()
removeTrivialEmptyNodes = pruneUnusable . skipSimpleEmptyNodes removeTrivialEmptyNodes = pruneUnusable . skipSimpleEmptyNodes
-- | Move edges to empty nodes with exactly one outgoing edge -- | Move edges to empty nodes to point to the next node(s).
-- or exactly one incoming edge to point to the next node(s).
-- This is not done if the pointed-to node is a final node. -- This is not done if the pointed-to node is a final node.
skipSimpleEmptyNodes :: (Eq a, Ord n) => FA n (Maybe a) () -> FA n (Maybe a) () skipSimpleEmptyNodes :: (Eq a, Ord n) => FA n (Maybe a) () -> FA n (Maybe a) ()
skipSimpleEmptyNodes fa = onGraph og fa skipSimpleEmptyNodes fa = onGraph og fa
@@ -196,10 +195,12 @@ skipSimpleEmptyNodes fa = onGraph og fa
info = nodeInfo g info = nodeInfo g
changeEdge e@(f,t,()) changeEdge e@(f,t,())
| isNothing (getNodeLabel info t) | isNothing (getNodeLabel info t)
&& (inDegree info t == 1 || outDegree info t == 1) -- && (i * o <= i + o)
&& not (isFinal fa t) && not (isFinal fa t)
= [ (f,t',()) | (_,t',()) <- getOutgoing info t] = [ (f,t',()) | (_,t',()) <- getOutgoing info t]
| otherwise = [e] | otherwise = [e]
-- where i = inDegree info t
-- o = outDegree info t
isInternal :: Eq n => FA n a b -> n -> Bool isInternal :: Eq n => FA n a b -> n -> Bool
isInternal (FA _ start final) n = n /= start && n `notElem` final isInternal (FA _ start final) n = n /= start && n `notElem` final