Data processing: speech signal processing – linguistics – language – Linguistics – Translation machine
Reexamination Certificate
2006-09-12
2006-09-12
Chawan, Vijay (Department: 2626)
Data processing: speech signal processing, linguistics, language
Linguistics
Translation machine
C706S020000, C704S009000
Reexamination Certificate
active
07107205
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.
REFERENCES:
patent: 5461573 (1995-10-01), Chakradhar et al.
patent: 5721939 (1998-02-01), Kaplan
patent: 6587844 (2003-07-01), Mohri
Kukula, James et al., Finite State Machine Decomposition By Transistion Pairing, IEEE, ICCAD-91,Nov. 1991, 414-417.
Pereira, Fernando et al., Finite-State Approximation of Phrase Structure Grammars, ACL-91, Jun. 1991, 246-255.
Devadas, Srinivas. Decomposition and Factoring of Sequential Finite State Machines, IEEE, Trans CAD, Nov. 1989, 1206-1217.
Roche, Emmanuel. Factorization of Finite-State Transducer, MERL-TR-95-2, Feb. 1995, 1-13.
Roche et al., Deterministic Part-Of-Speech Tagging with Finite State Transducers, MERL TR-94-07, Mar. 1995.
Johnston, Michael et al., Finite-state Multimodal Parsing and Understanding, Jul. 2000, Proceedings of the 17thconference on Computational Linguistics—vol. 1, p. 369-375.
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.
Chawan Vijay
Oliff & Berridg,e PLC
Pierre Myriam
Xerox Corporation
LandOfFree
Method and apparatus for aligning ambiguity in finite state... 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 aligning ambiguity in finite state..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for aligning ambiguity in finite state... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3545391