Speech recognition by composition of weighted finite automata
From MaRDI portal
Publication:2573070
DOI10.1007/s10994-005-0919-8zbMath1469.68080MaRDI QIDQ2573070
Publication date: 7 November 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-005-0919-8
kernel methods; weighted automata; statistical learning; string kernels; rational kernels; weighted finite-state transducers; spoken-dialog classification
68T05: Learning and adaptive systems in artificial intelligence
68Q45: Formal languages and automata
68T10: Pattern recognition, speech recognition
68T50: Natural language processing
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BoosTexter: A boosting-based system for text categorization
- The design principles of a weighted finite-state transducer library
- Support-vector networks
- On the definition of a family of automata
- 10.1162/153244302760200687
- 10.1162/1532443041424328
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines
- Implementation and Application of Automata