Method and apparatus for aligning ambiguity in finite state transducers
First Claim
Patent Images
1. A method for aligning ambiguity in an input finite-state transducer (FST) having an input side, comprising the steps of:
- creating a left-deterministic input finite-state automaton (FSA) having a plurality of arcs by extracting the input side and determinizing the input side from left to right; and
identifying each arc in the left-deterministic FSA, and for each such arc;
identifying at least one corresponding sub-path in the input FST; and
aligning the sub-path with at least one other corresponding sub-path by prepending arcs with symbols representative of an empty string.
4 Assignments
0 Petitions
Accused Products
Abstract
A method prepares a functional finite-state transducer (FST) with an epsilon or empty string on the input side for factorization into a bimachine. The method creates a left-deterministic input finite-state automation (FSA) by extracting and left-determinizing the input side of the functional FST. Subsequently, the corresponding sub-paths in the FST are identified for each arc in the left-deterministic FST and aligned.
-
Citations
17 Claims
-
1. A method for aligning ambiguity in an input finite-state transducer (FST) having an input side, comprising the steps of:
-
creating a left-deterministic input finite-state automaton (FSA) having a plurality of arcs by extracting the input side and determinizing the input side from left to right; and
identifying each arc in the left-deterministic FSA, and for each such arc;
identifying at least one corresponding sub-path in the input FST; and
aligning the sub-path with at least one other corresponding sub-path by prepending arcs with symbols representative of an empty string. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 12)
-
-
11. An apparatus for aligning ambiguity in an input finite-state transducer (FST) having an input side, comprising:
-
means for creating a left-deterministic input finite-state automaton (FSA) having a plurality of arcs by extracting the input side and determinizing the input side from left to right; and
means for identifying each arc in the left-deterministic FSA, and for each such arc said identifying means;
identifying at least one corresponding sub-path in the input FST; and
aligning the sub-path with at least one other corresponding sub-path by prepending arcs with symbols representative of an empty string. - View Dependent Claims (13, 14, 15, 16, 17)
-
Specification