diff options
| author | bringert <bringert@cs.chalmers.se> | 2007-01-03 18:28:25 +0000 |
|---|---|---|
| committer | bringert <bringert@cs.chalmers.se> | 2007-01-03 18:28:25 +0000 |
| commit | bf8b078a7aa3cc44edb09374d37fa4f744f5fe81 (patch) | |
| tree | 9a1f68a25b1cb2d8e3ca992863391b7d762ba45f | |
| parent | 8aa283aebdddfa662798f594211321dd18c9046b (diff) | |
Updated another reference to "Regular approximation of CFLs: a grammatical view"
| -rw-r--r-- | src/GF/Speech/CFGToFiniteState.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/GF/Speech/CFGToFiniteState.hs b/src/GF/Speech/CFGToFiniteState.hs index feb4db0ed..19ff105db 100644 --- a/src/GF/Speech/CFGToFiniteState.hs +++ b/src/GF/Speech/CFGToFiniteState.hs @@ -218,7 +218,7 @@ compileAutomata g = [(c, makeOneFA c) | c <- allCats g] -- | The make_fa algorithm from \"Regular approximation of CFLs: a grammatical view\", --- Mark-Jan Nederhof. International Workshop on Parsing Technologies, 1997, +-- Mark-Jan Nederhof, Advances in Probabilistic and other Parsing Technologies, 2000, -- adapted to build a finite automaton for a single (mutually recursive) set only. -- Categories not in the set will result in category-labelled edges. make_fa1 :: MutRecSet -- ^ The set of (mutually recursive) categories for which |