A Fast Realization of a Classification-Based Approach to Morphology
Wolfgang Finkler, Giinter Neumann · 1988
This paper presents an alternative approach to the use of the Finite State Automata for morphology in inflectional languages. The essential feature is the use of the morphological regularities of these languages to define a fine-grained word-class-specific subclassification. Morphological analysis and generation can be performed at the level of this classification by means of simple operations on n-ary trees. This approach has been implemented in the package MORPHIX which handles all inflectional phenomena of the German language. In spite of the complexity of the German inflection, the average time required to analyse a word is between 0.01 a.nd 0.02 cpu-seconds.