Data processing: speech signal processing – linguistics – language – Speech signal processing – Recognition
Patent
1996-06-14
1998-09-08
Hudspeth, David R.
Data processing: speech signal processing, linguistics, language
Speech signal processing
Recognition
704257, 704 9, G10L 900
Patent
active
058060324
ABSTRACT:
A method for automatically converting a decision tree into one or more weighted finite-state transducers. Specifically, the method in accordance with an illustrative embodiment of the present invention processes one or more terminal (i.e., leaf) nodes of a given decision tree to generate one or more corresponding weighted rewrite rules. Then, these weighted rewrite rules are processed to generate weighted finite-state transducers corresponding to the one or more terminal nodes of the decision tree. In this manner, decision trees may be advantageously compiled into weighted finite-state transducers, and these transducers may then be used directly in various speech and natural language processing systems. The weighted rewrite rules employed herein comprise an extension of conventional rewrite rules, familiar to those skilled in the art.
REFERENCES:
M.D. Riley, "Some Applications of Tree-based Modelling To Speech And Language," Proceedings of the Speech and Natural Language Workshop, Cape Cod, MA, Oct. 1989, pp. 339-352.
M. D. Riley, "A Statistical Model For Generating Pronunciation Networks," Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, ICASSP91, Oct. 1991, pp. S11.1-S11.4.
A. Ljolje et al., "Optimal Speech Recognition Using Phone Recognition and Lexical Access," Proceedings of ICSLP, Banff, Canada, Oct. 1992, pp. 313-316.
J. Oncina et al., "Learning Subsequential Transducers For Pattern Recognition Interpretation Tasks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, May 1993, pp. 448-458.
F. Pereira et al., "Weighted Rational Transductions and Their Application to Human Language Processing," ARPA Workshop on Human Language Technology, Mar. 1994, pp. 240-254.
R. Sproat, "A Finite-State Architecture for Tokenization and Grapheme-to-Phoneme Conversion in Multilingual Text Analysis," Proceedings of the EACL SIGDAT Workshop, Dublin, Ireland, Mar. 1995, pp. 65-72.
R. M. Kaplan et al., Regular Models of Phonological Rule Systems, Computational Linguistics, vol. 20, Sep. 1994, pp. 331-378.
D. Gildea et al., "Automatic Induction of Finite State Transducers for Simple Phonological Rules," 33rd Annual Meeting of the Associates for Computational Linguistics, Morristown, NJ, 1995, pp. 9-15, (Jun. 1995).
D.M. Magerman, "Statistical Decision-Tree Models For Parsing," 33rd Annual Meeting of the Association for Computational Linguistics, Morristown, NJ, Apr. 1995, pp. 276-283.
F. Pereira et al., "Speech Recognition by Composition of Weighted Finite Automata," CMP-LG archive paper 9603001, Mar. 1996, pp. 1-24.
Brown Kenneth M.
Hudspeth David R.
Lucent Technologies - Inc.
Wieland Susan
LandOfFree
Compilation of weighted finite-state transducers from decision t does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compilation of weighted finite-state transducers from decision t, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compilation of weighted finite-state transducers from decision t will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1296026