TWiki> FST Web>FstQuickTour>DeterminizeDoc (revision 11)EditAttach

Determinize

Description

This operation determinizes a weighted transducer. The result will be an equivalent FST that has the property that no state has two transitions with the same input label. For this algorithm, epsilon transitions are treated as regular symbols (cf. RmEpsilon).

The transducer must be functional. The weights must be (weakly) left divisible (valid for TropicalWeight and LogWeight for instance) and zero-sum-free.

Usage

template <class Arc>
void Determinize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst);
%DOX{namespacefst.html#Determinize[doc]}%
template <class Arc> DeterminizeFst<Arc>::
DeterminizeFst(const Fst<Arc> &fst);
%DOX{fst::DeterminizeFst[doc]}%
fstdeterminize a.fst out.fst
 

Examples

A:

determinize1.jpg

(TropicalWeight)

Determinize of A:

determinize2.jpg

Determinize(&A);
DeterminizeFst<Arc>(A);
fstdeterminize a.fst out.fst

Complexity

Determinize:
  • Determinizable: exponential (polynomial in the size of the output)
  • Non-determinizable: does not terminate
DeterminizeFst:
  • Determinizable: exponential (polynomial in the size of the output)
  • Non-determinizable: does not terminate

The determinizable automata include all unweighted and all acyclic input.

References

-- MichaelRiley - 20 Jun 2007

Topic attachments
I Attachment HistorySorted ascending Action Size Date Who Comment
JPEGjpg determinize1.jpg r2 r1 manage 12.5 K 2007-06-21 - 21:43 MichaelRiley  
JPEGjpg determinize2.jpg r2 r1 manage 13.7 K 2007-06-21 - 21:43 MichaelRiley  
Edit | Attach | Watch | Print version | History: r16 | r13 < r12 < r11 < r10 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r11 - 2014-04-23 - MichaelRiley
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback