Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Reexamination Certificate
2005-10-04
2005-10-04
Smits, Talivaldis Ivars (Department: 2654)
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
C704S257000
Reexamination Certificate
active
06952667
ABSTRACT:
A method extracts all infinite ambiguity from an input finite-state transducer (FST). The input FST is factorized into a first factor and a second factor such that the first factor is finitely ambiguous, and the second factor retains all infinite ambiguity of the original FST. The first factor is defined so that it replaces every loop where the input symbol of every arc is an ε (i.e., epsilon, empty string) by a single arc with ε on the input side and a diacritic on the output side. The second factor is defined so that it maps every diacritic to one or more ε-loops.
REFERENCES:
patent: 5095432 (1992-03-01), Reed
patent: 5721939 (1998-02-01), Kaplan
patent: 6032111 (2000-02-01), Mohri
patent: 6278973 (2001-08-01), Chung et al.
patent: 6574597 (2003-06-01), Mohri et al.
Devadas et al. 1989, Decomposition and Factorization of Sequential Finite State Machines, IEEE Transactions on Computer-Aided Design, vol. 8, No. 11, 1206-1217.
Elgot C.C et al. “On Relations Defined by Generalized Finite Automata,” IBM Journal of Research and Development, pp. 47-68, Jan. 1965.
Kempe, Andre “Reduction of Intermediate Alphabets in Finite-State Transducer Cascades,” 7thConference on Automatic Natural Language Processing (TALN), Lausanne, Switzerland; Sep. 16-18, 2000.
Kempe, Andre “Factorization of Ambiguous Finite-State Transducers,” Pre-Proceedings of the 5thInternational Conference on Implementation and Application of Automata (CIAA), p. 157-164, London, Ontario, Canada, Jul. 2000. Final Proceedings in: Springer-Verlag Lecture Notes in Computer Science.
Roche E. et al. “Introduction”, Finite-State Language Processing, MIT Press, Cambridge, MA, USA, pp. 1-66, Jun. 1997.
Sakarovitch, Jacques “A Construction on Finite Automata that has Remained Hidden,” Theoretical Computer Science, 204:205-231, Sep. 1998.
Schutzenberger, Marcel Paul “A Remark on Finite Transducers,” Information and Control, 4: 185-187, Sep. 1961.
Oliff & Berridg,e PLC
Shortledge Thomas
Smits Talivaldis Ivars
Xerox Corporation
LandOfFree
Method and apparatus for extracting infinite ambiguity when... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for extracting infinite ambiguity when..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for extracting infinite ambiguity when... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3468383