Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constituent-based morphological parsing: a new approach to the problem of word-recognition.
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Automatic induction of finite state transducers for simple phonological rules
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Statistical decision-tree models for parsing
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Some applications of tree-based modelling to speech and language
HLT '89 Proceedings of the workshop on Speech and Natural Language
Weighted rational transductions and their application to human language processing
HLT '94 Proceedings of the workshop on Human Language Technology
Multilingual text analysis for text-to-speech synthesis
Natural Language Engineering
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Re-engineering letter-to-sound rules
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Compiling boostexter rules into a finite-state transducer
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
A UNIFIED APPROACH TO GRAPHEME-TO-PHONEME CONVERSION FOR THE PLATTOS SLOVENIAN TEXT-TO-SPEECH SYSTEM
Applied Artificial Intelligence
Embodied conversational agents in Wizard-of-Oz and multimodal interaction applications
COST 2102'07 Proceedings of the 2007 COST action 2102 international conference on Verbal and nonverbal communication behaviours
Direct construction of compact context-dependency transducers from data
Computer Speech and Language
| Hi-index | 0.00 |
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string. Each leaf node can then be treated as a separate rule where the left and right contexts are constructable from the decisions made traversing the tree from the root to the leaf. These rules are compiled into transducers using the weighted rewite-rule rule-compilation algorithm described in (Mohri and Sproat, 1996).