Efficient methods in language description

Eötvös Loránd University, 2014/2015 fall

Topics

• finite automata and operations
• search with regular expressions in to morphologically and syntactically annotated corpora and databases
• Effectively learnable language classes: the Subregular Hierarchy
• transducers, Finite State Morphology
• weighted automata and transducer
• higher classes in the Chomsky hierarchy and the corresponding automata and machines
• equivalent formulations of non-counting languages (syntctic monoid, logic)
• Hidden Markov Models (Speech Recognition (1975), speech labeling (1983, 1992), bioinformatics (1992))

http://www.budling.hu/~makrai/

MTA NYI