The course will cover formal models for representing and analyzing syntax and semantics of words, sentences, and discourse. Students will learn how to analyse sentences algorithmically, using hand-crafted and automatically induced treebank grammars, how to make monotonic syntactic derivations, and build interpretable semantic representations. The course will also cover a number of standard algorithms that are used throughout language processing. Examples include Hidden Markov Models, the EM algorithm, and state space algorithms such as dynamic programming.
|
Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: school-office@inf.ed.ac.uk Please contact our webadmin with any comments or corrections. Logging and Cookies Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh |