3 Finite State Methods in Natural Language Processing

In this lecture, we will look at an area of natural language processing where the use of finite state techniques has been particularly popular. You will

1. learn what morphology is,

2. build a morphological parser based on finite state transducers, and

3. learn some more about the regular languages, expressions and relations, and how they relate to FSA and FST.

• 3.1 Morphology

• 3.2 Morphological Parsing
  • 3.2.1 From the Surface to the Intermediate Form
  • 3.2.2 From the Intermediate Form to the Morphological Structure
  • 3.2.3 Combining the two Transducers
  • 3.2.4 Putting it in Prolog

• 3.3 Regular Languages and Relations

• 3.4 Further Reading