Undergraduate Course: Informatics 2A - Processing Formal and Natural Languages (INFR08008)
Course Outline
| School |
School of Informatics |
College |
College of Science and Engineering |
| Course type |
Standard |
Availability |
Available to all students |
| Credit level (Normal year taken) |
SCQF Level 08 (Year 2 Undergraduate) |
Credits |
20 |
| Home subject area |
Informatics |
Other subject area |
None |
| Course website |
http://www.inf.ed.ac.uk/teaching/courses/inf2a |
|
|
| Course description |
This course is about processing natural and artificial languages, building on material covered in Informatics 1 concerning finite state machines and regular expressions. This course will consider how the same models of language can be used to describe and analyse both formal languages (such as programming languages) and natural languages (text and speech). It will include material on formal languages and grammars, probabilistic grammars (including hidden Markov models), semantic analysis and human language processing. Examples will be drawn from computer languages and natural language. |
Course Delivery Information
|
| Delivery period: 2010/11 Semester 1, Available to all students (SV1)
|
WebCT enabled: No |
Quota: None |
| Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
| Central | Lecture | | 1-11 | | | | 16:10 - 17:00 | | | Central | Lecture | | 1-11 | | | | | 16:10 - 17:00 | | Central | Lecture | | 1-11 | | 16:10 - 17:00 | | | |
| First Class |
Week 1, Tuesday, 16:10 - 17:00, Zone: Central. Lecture Theatre A, David Hume Tower |
Summary of Intended Learning Outcomes
1 - Demonstrate knowledge of the relationships between languages, grammars and automata, including the Chomsky hierarchy;
2 - Demonstrate understanding of regular languages and finite automata;
3 - Demonstrate understanding of context-free languages and pushdown automata, and how how context-free grammars may be used to model natural language;
4 - Demonstrate knowledge of top-down and bottom-up parsing algorithms for context-free languages;
5 - Demonstrate understanding of probabilistic finite state machines and hidden Markov models, including parameter estimation and decoding;
6 - Demonstrate awareness of probabilistic context-free grammars, and associated parsing algorithms;
7 - Demonstrate knowledge of issues relating to human language processing. |
Assessment Information
Written Examination 75
Assessed Assignments 25
Oral Presentations 0
Assessment
Three pieces of assessed coursework, including computer-based exercises.
If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year. |
| Please see Visiting Student Prospectus website for Visiting Student Assessment information |
Special Arrangements
| Not entered |
Contacts
| Course organiser |
Dr Jacques Fleuriot
Tel: (0131 6)50 9342
Email: Jacques.Fleuriot@ed.ac.uk |
Course secretary |
Ms Kendal Reid
Tel: (0131 6)50 5194
Email: kr@inf.ed.ac.uk |
|
copyright 2010 The University of Edinburgh -
1 September 2010 6:09 am
|
University Homepage