Data processing: speech signal processing – linguistics – language – Speech signal processing – Recognition
Reexamination Certificate
2008-04-28
2009-12-15
Wozniak, James S (Department: 2626)
Data processing: speech signal processing, linguistics, language
Speech signal processing
Recognition
C704S009000, C704S257000, C704S258000, C704S001000
Reexamination Certificate
active
07634408
ABSTRACT:
An improved ε-removal method is disclosed that computes for any input weighted automaton A with ε-transitions an equivalent weighted automaton B with no ε-transitions. The method comprises two main steps. The first step comprises computing for each state “p” of the automaton A its ε-closure. The second step in the method comprises modifying the outgoing transitions of each state “p” by removing those labeled with ε. The method next comprises adding to the set of transitions leaving the state “p” non-ε-transitions leaving each state “q” in the set of states reachable from “p” via a path labeled with ε with their weights pre-{circle around (x)}multiplied by the ε-distance from state “p” to state “q” in the automaton A. State “p” is a final state if some state “q” within the set of states reachable from “p” via a path labeled with ε is final and the final weightρ[p]=⊕q∈ɛ[p]⋂F(d[p,q]⊗p[q]).
REFERENCES:
patent: 5095432 (1992-03-01), Reed
patent: 5806032 (1998-09-01), Sproat
patent: 6032111 (2000-02-01), Mohri
patent: 6073098 (2000-06-01), Buchsbaum et al.
patent: 6499132 (2002-12-01), Morley et al.
patent: 6574597 (2003-06-01), Mohri et al.
patent: 6760636 (2004-07-01), Kempe
Weng, F.L, Stolcke, a., and Sankar, A. (1998), Efficient Lattice Representation and Generation. In the Proceedings of International Conference on Spoken Language Processing, Sydney, Australia, Nov. 30- Dec. 4, 1998.
Mehryar Mohri et al.; A Rational Design for a Weighted Finite-State Transducer Library. Proceedings of the Second International Workshop on Implementing Automata (WIA '97). vol. 1436 of Lecture Notes in Computer Science, pp. 144-158. Sep. 1998.
Van Noord, Gertjan; “Treatment of Epsilon Moves in Subset Construction;” Computational Linguistics, vol. 26, No. 1, pp. 61-76, Mar. 2000.
“Weighted Automata in Text and Speech Processing” by M. Mohri et al., AT&T Corp. 1966, ECAI 96. 12thEuropean Conference on Artificial Intelligence, edited by W. Wahlster, Published in 1996 by John Wiley & Sons, Ltd., 5 pages.
“The Design Principles of Weighted Finite-State Transducer Library,” by M. Mohri et al., Preprint submitted to Elsevier Preprint, May 3, 1999, 19 pages.
“Speech Recognition by Composition of Weighted Finite Automata,” by F.C.N. Pereira et al., AT&T Labs—Research, Murray Hill, New Jersey, Apr. 20, 1996, 24 pages
“State Assignment of Finite-State Machines,” by I. Ahmad et al., IEEE Proc. Comput. Digit. Tech., vol. 147, No. 1, Jan. 2000, 8 pages.
Mohri, “Generic Epsilon-Removal Algorithm for Weighted Automata,” in Sheng Yu Andrei Paun, ed., 5thInternational Conference, CIAA 2000, v. 2088 of Lecture Notes in Computer Science, Springer-Verlag, 2001.
AT&T Intellectual Property II L.P.
Wozniak James S
LandOfFree
System and method of epsilon removal of weighted automata... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method of epsilon removal of weighted automata..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method of epsilon removal of weighted automata... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4116144