This page intends to describe how and why the morphological dictionaries in Apertium work the way they do. Morphological dictionaries in Apertium (or more properly lttoolbox) are based on finite-state transducer technology, in this way they can also be referred to as lexical transducers. The task of a morphological dictionary is to model the rules that govern the internal structure of words in a language.
For example, speakers of English realise that the words "dog" and "dogs" are related, that "dogs" is to "dog" as "cats" is to "cat". The rules understood by the speaker reflect specific patterns and regularities in the way in which words are formed from smaller units and how those smaller units interact.
Finite-state transducers are not the only way to model these rules, it is also possible to write the rules in scripting languages such as perl or python, or as a lexer (examples include the Buckwalter morphological analyser for Arabic or IceMorphy for Icelandic). There are however a number of downsides to this method:
- The analysers created are not reversible, that is, you cannot use the same model to analyse and generate.
- As the rule content may be both imperative and declarative, programs can be more complicated to understand and edit by non-experts.
In contrast, finite-state transducers are: reversible, the same description can be used for both analysis and generation; declarative, in that a description of the morphological rules is written as separate from the algorithm which processes them. Note that analysers may also be described as decorated tries, or finite-state acceptors (for example hunmorph), this may be declarative, but non-reversible (i.e. not applicable to generation).
To start with it is worth defining what is a finite-state automaton, and how the two main types differ. This will not be an exhaustive description, just an overview so that the difference can be distinguished for the purposes of this article. To begin with, some terminology, if you are familiar with graphs (as in the data structure) this might help. A finite-state automaton can be visualised as a graph, with the nodes representing states, and the arcs representing transitions.
A finite-state acceptor (or recogniser), as seen to the right, is an automaton which accepts or rejects input strings. So, taking the example at the right, we can see the automaton has:
- a number of possible input characters, or alphabet (the characters 'b', 'e' and 'r'), denoted as Σ
- a start state, in formal definitions this is usually labelled s0
- a number of intermediate states, often denoted by S
- two final states, denoted by F
- a number of transitions
We can crudely emulate this in a programming language such as python in order to get an idea of the behaviour of these automata.
When the input on
stdin is "beer", output yes, otherwise output no,
$ echo "beer" | python fsa.py Yes $ echo "bee" | python fsa.py No
It is worth noting that a finite-state acceptor can accept any string that can be defined by a regular expression. For example, if we want to accept the expression
be*r, that is "b" followed by one or more "e" followed by "r" (e.g. ber, beer, beeer, ...), we could do it with a finite-state acceptor. Finite-state acceptors can be used in applications such as spell-checking, where one of the basic tasks is to check if a word exists or not in a list of words. Using an acceptor is more efficient than the equivalent list for reasons which will be outlined below.
- fill in more formal stuff here
Whilst acceptors are useful, for morphological analysis we need something that will give us an output for a given input. For example, given a surface form of a word, it will give us the lexical form (analysis) or given the lexical form it will give us the surface form (generation). For this, we need a transducer. A transducer is very much like an acceptor, with the main difference that instead of each transition consuming a character from the input, each transition consumes a character and outputs a character. So instead of having a symbol on each arc, we have a tuple, input and output (see diagram to the right).
The diagram to the right shows a finite-state transducer for the strings "beer" and "beers", this transducer has:
- an input alphabet, Σ (the characters 'b', 'e', 'r' and 's')
- an output alphabet, Γ (the characters 'b', 'e', 'r' and the multi-character symbols
- a start state, s0
- a number of intermediate states, S
- a final states, F
- a number of transitions
Note how in the diagram, the "non-accepting" state (no) has been left out.
Again, we can emulate this transducer with some python code:
$ echo "beer" | python fst.py beer<n><sg> $ echo "beers" | python fst.py beer<n><pl>
The transducer on the right is deterministic, that is that for any given state and input symbol it can only pass on to one state, or accept. In contrast, a non-deterministic transducer is one which from a given state and input symbol can branch to more than one state. That is that it can take more than one path through the transducer simultaneously. Note that although the transducer on the right branches, it branches in a deterministic way, after consuming the string "beer", it can either step to
(s:<n>) if the next input symbol is 's', or
- empty string
- Ortiz-Rojas, S., Forcada, M. L., and Ramírez-Sánchez, G. (2005) "Construcción y minimizacion eﬁciente de transductores de letras a partir de diccionarios con paradigmas". Procesamiento del Lenguaje Natural, 35, 51–57.
- A. Garrido-Alenda, M.L. Forcada, (2002) "Comparing nondeterministic and quasideterministic finite-state transducers built from morphological dictionaries", Procesamiento del Lenguaje Natural, (XVIII Congreso de la Sociedad Española de Procesamiento del Lenguaje Natural, Valladolid, Spain, 11-13.09.2002)
- R.C. Carrasco, M.L. Forcada, (2002) "Incremental construction and maintenance of minimal finite-state automata", Computational Linguistics, 28:2, 207-216
- Alicia Garrido-Alenda, Mikel L. Forcada, Rafael C. Carrasco, (2002) "Incremental construction and maintenance of morphological analysers based on augmented letter transducers", in Proceedings of TMI 2002 (Theoretical and Methodological Issues in Machine Translation, Keihanna/Kyoto, Japan, March 2002), p. 53-62