General details of the subject
- Face-to-face degree course
Description and contextualization of the subject
The main objective of this course is presentation of the main concepts and models for the computational treatment of morphology (regular expressions, finite-state automata etc). The course will center mainly on languages with rich morphology. During the course, the student will use the foma tool, a free and open source tool for finite-state processing. The course also introduces neural sequence-to-sequence (seq2seq) models as applied to morphology using the OpenNMT tool.
|GOJENOLA GALLETEBEITIA, KOLDOBIKA||University of the Basque Country||Profesorado Titular De Universidad||Doctor||Bilingual||Computer Languages and Systemsfirstname.lastname@example.org|
|ORONOZ ANCHORDOQUI, MAITE||University of the Basque Country||Profesorado Agregado||Doctor||Bilingual||Computer Languages and Systemsemail@example.com|
|URIZAR ENBEITA, RUBEN||University of the Basque Country||Profesorado Titular De Universidad||Doctor||Bilingual||Teaching of Language and Literaturefirstname.lastname@example.org|
|MANS , HULDEN||University of Colorado, Boulder||Otros||Doctor|
|Ability to handle and adapt the symbolic methods available for their use in applications for language processing.||40.0 %|
|Ability to use and adapt the tools available for processing different languages (morphological analyzers).||30.0 %|
|Ability to design, handle, and enrich language resources and tools for the processing of human language.||30.0 %|
|Type||Face-to-face hours||Non face-to-face hours||Total hours|
|Applied laboratory-based groups||30||45||75|
|Name||Hours||Percentage of classroom teaching|
|Prácticas con ordenador, laboratorio, salidas de campo, visitas externas||75.0||40 %|
|Name||Minimum weighting||Maximum weighting|
|Attendance and participation||5.0 %||5.0 %|
|Practical tasks||60.0 %||60.0 %|
|Written examination||35.0 %||35.0 %|
Learning outcomes of the subject
- Identify and solve problems that can be tackled using restricted computational models (automata) or alternative ones (intelligent systems).
- Use automata, grammars and regular expressions to define formal languages.
-To know the existing formalisms to describe the morphology of different languages.
- Implement an application of the area of morphology (morphological analyzer, spell checker etc.) using the available tools.
Ordinary call: orientations and renunciation
The assignments in exercise mode correspond mostly to the formal language part (50% of the final grade). Students who demonstrate that they have already completed this part in their previous studies may be exempted from attending class and doing the exercises and to obtain this part of the grade they will do a practical assignment with the corresponding report that they will present in class.
The project is related to the morphology part (50% of the final grade).
- Class assignments (50%): exercises, notes, ...
- Project (50%): Implementation of a practical project proposed by the teacher
Extraordinary call: orientations and renunciation
- Final exam (100%) with theoretical and practical exercices
2. FORMAL LANGUAGES AND THEIR APPLICATIONS
2.1. Basic concepts
2.2. Regular languages
3.1. Formalisms for computational morphology
3.2. Morphotactics and Phonology. Phenomena in several languages
3.3. Finite-State Morphology. Examples and problems using FOMA: Lexicon, Morphology, Surface-Syntax
3.4. Morphological analysis and generation using seq2seq methods.
- Sipser, M. (2012). Introduction to the Theory of Computation. Cengage Learning.
- Brian Roark and Richard Sproat. 2007. Computational Approaches to Morphology and Syntax. Oxford University Press
- Beesley and Karttunen. Finite-State Morphology. 2003. CSLI Publications.
- Sproat R. (1992). Morphology and Computation. The MIT Press.