Algorithms for Automated Language Structure Processing - NPFL049
Title: Algoritmy pro automatické zpracování jazykových struktur
Guaranteed by: Institute of Formal and Applied Linguistics (32-UFAL)
Faculty: Faculty of Mathematics and Physics
Actual: from 2003
Semester: winter
E-Credits: 3
Hours per week, examination: winter s.:0/2, C [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: cancelled
Language: Czech
Teaching methods: full-time
Guarantor: RNDr. Kiril Ribarov, Ph.D.
Class: Informatika Mgr. - Matematická lingvistika
Classification: Informatics > Computer and Formal Linguistics
Pre-requisite : NDMI011, NPRG005, NTIN013
Opinion survey results   Examination dates   Schedule   Noticeboard   
Annotation -
One semester course with a broad scope on mainly non-statistical algorithms for automatic learning of language phenomena. The most up-to-date works on rule-based approach, memory/analogy-based approach, neural networks and genetic algorithms, naive approaches, partial trees method (association to Tree-Adjoining Grammars), ways of combining various approaches, will be presented. Main part of the course duties will be focused on a complex case study on one of the above stated topics.
Last update: T_UFAL (15.05.2002)
Syllabus -

The following topics will be considered while mainly one of them will be studied in more detail:

  • Rule based approach
  • Memory based approach
  • Neural networks and genetic algorithms
  • Naive approaches
  • Partial trees method (association to Tree-adjoining grammars)
  • ways of combining various approaches.

The listed topics will be analysed mainly based on ready available algorithms. Where not available, their modification or development will be considered. Study of printed articles is as well a part of the course.

Last update: T_UFAL (16.05.2002)