Method and apparatus for factoring finite state transducers with unknown symbols
AssigneeXerox Corporation
InventorAndre Kempe
Life of this patent
Estimating the term…
Abstract
A method factors an input finite state transducer (FST) with unknown symbols into a left-sequential FST and a right-sequential FST while avoiding direct factorization of the unknown symbols. The left-sequential FST is formed by replacing each occurrence of the unknown symbol in the input FST with a sequence of the unknown symbol and a diacritic. The right-sequential FST is formed by replacing each occurrence of the diacritic with a symbol representative of an empty string and an output symbol.
Claims14
A method for factoring an input finite-state transducer (FST) including an unknown symbol, comprising the steps of:
- replacing each occurrence of the unknown symbol in the input FST with the unknown symbol and a diacritic to define a left-sequential finite-state transducer (FST);
- and
- replacing each occurrence of the diacritic with a symbol representative of an empty string and an output symbol to define a right-sequential finite-state transducer (FST);
- wherein said replacing steps avoid direct factorization of the unknown symbol.
An apparatus for factoring an input finite-state transducer (FST) including an unknown symbol, comprising:
- means for replacing each occurrence of the unknown symbol in the input FST with the unknown symbol and a diacritic to define a left-sequential finite-state transducer (FST);
- and
- means for replacing each occurrence of the diacritic with a symbol representative of an empty string and an output symbol to define a right-sequential finite-state transducer (FST);
- wherein said replacing means avoid direct factorization of the unknown symbol.
Dependencies are inferred from the claim text.