This is the home page of a course I taught a few years ago at Columbia
University as an adjunct professor in the computer science
department.
COURSE
PRIMARY RESEARCH AREAS
- Theoretical computer science: machine learning, formal
language theory, rational power series, semirings, automata.
- Algorithms: computational biology, generic
algorithms, weighted automata and transducer algorithms, text
processing, string-matching, indexation, compression.
- Natural language processing: syntax, grammar and language
modeling, parsing, large-vocabulary
speech recognition, speech synthesis, speech mining, spoken-dialog
applications.
SOFTWARE LIBRARIES
- Decoder Library (DCD Library 2.0):
software collection for decoding and related functions; designed for
speech recognition and other decoding applications.
- Finite-State Machine Library (FSM Library 4.0):
general-purpose software for building, combining, optimizing, and
searching weighted automata and transducers.
- Grammar Library (GRM Library 4.0):
general software collection for constructing and modifying weighted
automata and transducers representing grammars or language models.
- Open-source Finite-State Transducer Library (OpenFst Library): open-source library for creating, combining, optimizing, and searching weighted automata and transducers.
RECENT TUTORIALS
- Weighted Finite-State Transducers in Speech Recognition
(Tutorial) [Part
I, Part
II] (with Michael Riley). International Conference on
Spoken Language Processing 2002 (ICSLP '02). Denver, Colorado,
September 2002.
- Weighted Finite-State Transducers in Text and Speech Processing
(Tutorial). Graduate School of Language Technology in
Finland, University of Helsinki. Helsinki, Finland, May 2003.
- Weighted Finite-State Transducers (Tutorial).
International School in Formal Languages and
Applications. Tarragona, Spain, December 2003.
PUBLICATIONS
Rational Kernels
Shortest-Distance Algorithms
Weighted Finite-State Transducers
|
