Factorization of Ambiguous Finite-State Transducers

@inproceedings{Kempe2000FactorizationOA,
  title={Factorization of Ambiguous Finite-State Transducers},
  author={Andr{\'e} Kempe},
  booktitle={CIAA},
  year={2000}
}
This article describes an algorithm for factorizing an ambi guous finite-state transducer (FST) into two FSTs, T1 andT2, such thatT1 is functional andT2 retains the ambiguity of the original FST. The application o f T2 to the output ofT1 never leads to a state that does not provide a transition for t he next input symbol, and always terminates in a final state. In other words, T2 contains no “failing paths” whereas T1 in general does. Since T1 is functional, it can be factorized into a left… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Introduction

  • Roche, Emmanuel, Yves Schabes.
  • Em
  • 1997

Regular expressions for language engineering

  • Anne Schiller
  • 1996

Similar Papers

Loading similar papers…