Continuously variable duration hidden Markov models for automatic speech recognition
Computer Speech and Language
A phonemic transcription program for Polish
International Journal of Man-Machine Studies
Learning Syntax by Automata Induction
Machine Learning
Nonconcatenative finite-state morphology
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Finite state processing of tone systems
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
In this paper an architecture and an implementation for a linguistically based prosodic analyser is presented. The implementation is designed to handle typical prosodic input in the form of parallel input channels, and processes each input channel independently in a data-directed, phonologically motivated configuration of partly parallel, partly cascaded feature modules and module clusters, each implemented as finite transducers, producing intonationally relevant categories as output. The design criteria included maximal restriction of computational power (the system could be compiled into one massive finite transducer); relevance to computational linguistic formalisms with a view to developing an integrated model mapping prosodic structures on to textual structures; relatability to speech recognition algorithms, and to phonological theories. It was implemented in an object oriented environment with parallel processing simulation (CheOPS), and a linguistically interesting surface language (BATLAN).