Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Reexamination Certificate
2005-11-15
2005-11-15
{hacek over (S)}mits, Tālivaldis Ivars (Department: 2654)
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
C704S257000
Reexamination Certificate
active
06965858
ABSTRACT:
A method reduces the number of diacritics and other intermediate symbols occurring between two factors that result from any factorization such as extraction of infinite ambiguity, factorization of finitely ambiguous finite-state transducer, or bimachine factorization. The method a posteriori removes all redundant intermediate symbols. The method can be used with any two finite-state transducers (FSTs) that operate in a cascade. With longer cascades, the method can be applied pair-wise to all FSTs, preferably starting from the last pair.
REFERENCES:
patent: 5510981 (1996-04-01), Berger et al.
patent: 5721939 (1998-02-01), Kaplan
patent: 5737621 (1998-04-01), Kaplan et al.
patent: 6278973 (2001-08-01), Chung et al.
patent: 6424983 (2002-07-01), Schabes et al.
patent: 6601026 (2003-07-01), Appelt et al.
Ferrandi et al. 1996, Symbolic Optimization of FSM Networks Based on Sequential ATPG Techniques, Proceedings of the 33rd annual conference on Design Automation, pp. 467-470.
Devadas et al. 1989, Decomposition and Factorization of Sequential Finite State Machines, IEEE Transactions on Computer-Aided Design, vol. 8. No. 11, pp. 1206-1217.
Mohri, Mehryar, 1997, Finite-State Transducers in Language and Speech Processing, Association for Computational Linguistics, pp. 269-311.
Elgot C.C. et al. “On Relations Defined by Generalized Finite Automata,” IBM Journal of Research and Development, pp. 47-68, 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, 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, 1997.
Sakarovitch, Jacques “A Construction on Finite Automata that has Remained Hidden,” Theoretical Computer Science, 204:205-231, 1998.
Schutzenberger, Marcel Paul “A Remark on Finite Transducers,” Information and Control, 4: 185-187, 1961.
Shortledge Thomas E.
Xerox Corporation
{hacek over (S)}mits Tälivaldis Ivars
LandOfFree
Method and apparatus for reducing the intermediate alphabet... 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 reducing the intermediate alphabet..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for reducing the intermediate alphabet... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3451677