Abstract
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 and 0.02 cpu-seconds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Bergmann. Lemmatisierung in HAM-ANS.Memo ANS-10, Fachbereich Informatik, Universität Hamburg, 1983.
S. Busemann. Oberflächentransformationen bei der automatischen Generierung geschriebener deutscher Sprache - Entwurf und Implementierung des modularen und anpassbaren Systems SUTRA. Master’s thesis, Fachbereich Informatik, Universität Hamburg, 1983.
W. Finkler and G. Neumann. MORPHIX - Ein hochportabler Lemmatisierungsmodul für das Deutsche. Memo 8, Fachbereich Informatik, Universität des Saarlandes, 7 1986.
W. Finkler and G. Neumann. POPEL-HOW: Eine Komponente zur parallelen, inkrementellen Generierung natürlichsprachlicher Sätze aus konzeptuellen Einheiten. Technical Report, SFB 314, Fachbereich Informatik, Universität des Saarlandes, 1988.
K. Harbusch. A First Snapshot of XTRAGRAM, a Unification Grammar Based on PATR. Memo 14, SFB 314, Fachbereich Informatik, Universität des Saarlandes, 12 1986.
L. Karttunen. D-PATR. A Development Environment for Unification-Based Grammars. Technical Report, SRI International and Center for the Study of Language and Information, Stanford, 1986.
M. Kay. When meta-rules are not meta-rules. In Sparck-Jones & Wilks, editor, Automatic natural language processing, University of Essex, Cognitive Studies Centre, 1982. CSM-10.
M. Kay. Nonconcatenative finite-state morphology. In 3rd Conference of the European Chapter of the ACL, pages 2–10, University of Copenhagen, Copenhagen, Denmark, 1987.
K. Koskenniemi. Two-level model for morphological analysis. In IJCAI -1983, pages 683–685, Karlsruhe, 1983.
K. Koskenniemi. A general computational model for word-form recognition and production. In COLING 1984, pages 178–181, Stanford University, California, 1984.
G. Schott. Automatic analysis of inflectional morphems in german nouns. Acta Informatica, 1: 360–374, 1972.
Sonderforschungsbereich 100, editor. SALEM: Ein Verfahren zur automatischen Lemmatisierung deutscher Texte. Niemeyer, Tübingen, 1980.
H. Trost and G. Dorffner. A system for morphological analysis and synthesis of germ an texts. In D. Hainline, editor, Foreign Language CAI, Croom Helm, London, 1985.
Künstliche Intelligenz–Wissensbasierte Systeme. Frühjahr 1987. SFB–314 Arbeits- und Ergebnisbericht für die Jahre 1985–1986–3/1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finkler, W., Neumann, G. (1988). MORPHIX. In: Trost, H. (eds) 4. Österreichische Artificial-Intelligence-Tagung. Informatik-Fachberichte, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73998-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-73998-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50180-0
Online ISBN: 978-3-642-73998-9
eBook Packages: Springer Book Archive