This course covers the essential theory, algorithms, and applications of weighted transducers to text speech processing Material goes significantly beyond what can be found in standard textbooks on formal languages. Most courses 4000-level and above can be credited to all degree programs.
All courses are subject to advisor's approval.
See registration procedures for ordering information. The main theoretical and algorithmic results will be given in full. Recent advances in computational linguistics have confirmed that weighted finite automata and finite-state transducers are very effective tools in speech processing because they support efficient algorithms capable of handling the very large information sources arising in this field. This course covers the essential theory, algorithms, and applications of weighted transducers to text and speech processing. The theoretical component of the course presents the aspects of the theory of automata relevant to text and speech processing.