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.

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 course can be approved in two ways, by continuous assessment or by final assessment. Continuous evaluation will be prioritized.



Several options for continuous assessment are proposed (to be chosen by the student):



1- For students who can demonstrate that they already have studied the ”Formal Languages” subject. These could be the assessment types:

  * 45 % of the grade with a basic work ( documentation and implementation  )  and 55 % with a practical work on morphology.

* 100 % of the grade by submitting, at the end of the course, a practical work (including documentation and implementation) related to the student’s research interest or some of the suggested project.



2-Assessment recommend for those students with a ”linguistic” background:

  * 45 % of the grade with quizzes and 55 % with a practical work on morphology.



Final assessment:



- Final exam (100%) with theoretical and practical exercices



A minimum final grade of 5 is required to pass the course.



NOTE: In case of return to confinement, the evaluation tests (both  for  continuous and  for final  assessment ) will be carried out telematically through questionnaires, interviews and/or eGela  assignments and via BBC connection.

Extraordinary call: orientations and renunciation

- Final exam (100%) with theoretical and practical exercices



A minimum final grade of 5 is required to pass the course.



 NOTE: In case of return to confinement, the evaluation tests (both for continuous and for final assessment ) will be carried out telematically through questionnaires, interviews and/or eGela assignments and via BBC connection.

Temary

1. INTRODUCTION

2. FORMAL LANGUAGES AND THEIR APPLICATIONS

2.1. Basic concepts

2.2. Regular languages

3. MORPHOLOGY

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.

Bibliography

Basic bibliography

- 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.