Data processing: artificial intelligence – Neural network – Learning task
Reexamination Certificate
2006-09-15
2009-12-01
Holmes, Michael B (Department: 2129)
Data processing: artificial intelligence
Neural network
Learning task
Reexamination Certificate
active
07627541
ABSTRACT:
A Q Framework, or QFX for short, is provided for performing efficient tree transformation in a generalized manner that achieves preservation of action semantics for FSTs that support action information in their representations across a diverse set of types of representations for FSTs. Among other features, the QFX also enables the preservation of ordered and unordered nest information while performing tree transformation, supports the transformation of non-deterministic data structures to a deterministic data structure and enables intersection operations on machines having action semantics.
REFERENCES:
patent: 5806032 (1998-09-01), Sproat
patent: 6032111 (2000-02-01), Mohri
patent: 6128606 (2000-10-01), Bengio et al.
patent: 6308149 (2001-10-01), Gaussier et al.
patent: 6735592 (2004-05-01), Neumann et al.
patent: 7069215 (2006-06-01), Bangalore et al.
patent: 7072880 (2006-07-01), Beesley
patent: 7107205 (2006-09-01), Kempe
patent: 7113903 (2006-09-01), Riccardi et al.
patent: 7120586 (2006-10-01), Loui et al.
patent: 7181386 (2007-02-01), Mohri et al.
patent: 7197460 (2007-03-01), Gupta et al.
patent: 7222067 (2007-05-01), Glushnev et al.
patent: 7225131 (2007-05-01), Bangalore et al.
patent: 7240004 (2007-07-01), Allauzen et al.
patent: 7243305 (2007-07-01), Schabes et al.
patent: 7257575 (2007-08-01), Johnston et al.
patent: 7295975 (2007-11-01), Bangalore et al.
patent: 7299180 (2007-11-01), Wang et al.
patent: 7340388 (2008-03-01), Soricut et al.
patent: 7383185 (2008-06-01), Mohri
patent: 7398197 (2008-07-01), Mohri et al.
patent: 7401303 (2008-07-01), Gunawardana
patent: 7451089 (2008-11-01), Gupta et al.
patent: 7451125 (2008-11-01), Bangalore
patent: 7493251 (2009-02-01), Gao et al.
patent: 7499862 (2009-03-01), Bangalore et al.
patent: 7505908 (2009-03-01), Johnston et al.
patent: 7536295 (2009-05-01), Cancedda et al.
patent: 7542893 (2009-06-01), Cancedda et al.
patent: 7542908 (2009-06-01), Segond et al.
patent: 2004/0176945 (2004-09-01), Inagaki et al.
patent: 2005/0154979 (2005-07-01), Chidlovskii et al.
patent: 2006/0085389 (2006-04-01), Flanagan et al.
Finite state transducers for policy evaluation and conflict resolution Baliosian, J.; Serrat, J.; Policies for Distributed Systems and Networks, 2004. Policy 2004. Proceedings. Fifth IEEE International Workshop on Jun. 7-9, 2004 pp. 250-259 Digital Object Identifier 10.1109/POLICY.2004.1309177.
Large vocabulary continuous Mandarin speech recognition using finite state machine Yi-Cheng Pan; Chia-Hsing Yu; Lin-Shan Lee; Chinese Spoken Language Processing, 2004 International Symposium on Dec. 15-18, 2004 pp. 5-8 Digital Object Identifier 10.1109/CHINSL.2004.1409572.
Interactive grammar inference with finite state transducers Caskey, S.P.; Story, E.; Pieraccini, R.; Automatic Speech Recognition and Understanding, 2003. ASRU '03. 2003 IEEE Workshop on Nov. 30-Dec. 3, 2003 pp. 572-576 Digital Object Identifier 10.1109/ASRU.2003.1318503.
Efficient Generation of high-order context-dependent Weighted Finite State Transducers for Speech Recognition Schuster, M.; Hori, T.; Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on vol. 1, Mar. 18-23, 2005 pp. 201-204 Digital Object Identifier 10.1109/ICASSP.2005.1415085.
Finite state transducers for policy evaluation and conflict resolution Baliosian, J.; Serrat, J.; Policies for Distributed Systems and Networks 2004 Policy 2004. Proceedings. Fifth IEEE International Workshop on Jun. 7-9, 2004 pp. 250-259 Digital Object Identifier 10.1109/Policy.2004.1309177.
Large vocabulary continuous Mandarin speech recognition using finite state machine Yi-Cheng Pan; Chia-Hsing Yu; Lin-Shan Lee; Chinese Spoken Language Processing, 2004 International Symposium on Dec. 15-18, 2004 pp. 5-8 Digital Object Identifier 10.1109/CHINSL.2004.1409572.
Construction of weighted finite state transducers for very wide context-dependent acoustic models Schuster, M.; Hori, T.; Automatic Speech Recognition and Understanding, 2005 IEEE Workshop on Nov. 27-27 2005 pp. 162-67 Digital Object Identifier 10.1109/ASRU.2005.1566482.
Evolving finite state transducers to interpret deepwater reservoir depositional environments Yu, T.; Wilkinson, D.; Clark, J.; Sullivan, M.; Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on Jun. 1-6, 2008 pp. 3491-3498 Digital Object Identifier 10.1109/Cec.2008.4631270.
Interactive grammar inference with finite state transducers Caskey, S.P.; Story, E.; Pieraccini, R.; Automatic Speech Recognition and Understanding, 2003. ASRU '03. 2003 IEEE Workshop on Nov. 30, Dec. 3, 2003 pp. 572-576 Digital Object Identifier 10.1109/ASRU.2003.1318503.
Efficient Generation of high-order context-dependent Weighted Finite State Transducers for Speech Recognition Schuster, M.; Hori, T.; Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on vol. 1, Mar. 18-23, 2005 pp. 201-204 Digital Object Identifier 10.1109/Icassp.2005.1415085.
Grapheme-to-phone using finite-state transducers Caseiro, D.; Trancoso, L.; Oliveira, L.; Viana, C.; Speech Synthesis, 2002. Proceedings of 2002 IEEE Workshop on Sept.11-13, 2002 pp. 215-218 Digital Object Identifier 10.1109/WSS.2002.1224412.
Multilingual text analysis for text-to-speech synthesis Sproat, R.; Spoken Language, 1996. ICSLP 96. Proceedings., Fourth International Conference on vol. 3, Oct. 3-6, 1996 pp. 1365-1368 vol. 3 Digital Object Identifier 10.1109/ICSLP.1996.607867.
N. Susumu, et al., XML stream transformer generation through program composition and dependency analysis. Science of Computer Programming. Feb. 2005, vol. 54, pp. 257-290, ISSN 0167-6423.
International Search Report dated Jan. 7, 2008 for PCT Application Serial No. PCT/US2007/078540, 2 Pages.
Graehl, et al., “Training tree transducers.” In Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL), Boston, May 2004, pp. 105-112.
International Search Report and Written Opinion dated Feb. 29, 2008 for PCT Application Serial No. PCT/US2007/078522, 10 Pages.
Alfred Aho, Ravi Sethi, and Jeffrey Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
John Hopcroft, Jeffrey Ullman, and Rajeev Motwani. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 2000.
Della-Libera Giovanni M.
Langworthy David E.
Lucco Steven E.
Holmes Michael B
Microsoft Corporation
Turocy & Watson LLP
LandOfFree
Transformation of modular finite state transducers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Transformation of modular finite state transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transformation of modular finite state transducers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4146201