Abstract
Koskenniemi’s two-level morphological analysis system can be improved upon by using a PATR-like unification grammar for handling the morphosyntax instead of continuation classes, and by incorporating the notion of negative rule feature into the phonological rule interpreter. The resulting system can be made to do generation and recognition using the same grammars.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bear, John (1985) “Interpreting Two-level Rules Directly,” presented at a Stanford workshop on finite-state morphology.
Bear, John (1986) “A Morphological Recognizer with Syntactic and Phonological Rules,” COLING 86.
Bear, John (1988) “Two-level Rules and Negative Rule Features,” to appear in the proceedings of COLING 88.
Karttunen, Lauri (1983) “Kimmo: A General Morphological Processor,” in Texas Linguistic Forum #22, Dalrymple et al., eds., Linguistics Department, University of Texas, Austin, Texas.
Karttunen, Lauri, Kimmo Koskenniemi and Ronald Kaplan (1987) “TWOL: A Compiler for Two-level Phonological Rules,” distributed at the 1987 Summer Linguistic Institute at Stanford University, Stanford, California.
Karttunen, Lauri (1984) “Features and Values,” in COLING 84.
Karttunen, Lauri and Kent Wittenburg (1983) “A Two-level Morphological Analysis Of English,” in Texas Linguistic Forum #22, Dalrymple et al., eds., Linguistics Department, University of Texas, Austin, Texas.
Kay, Martin (1983) “When Meta-rules are not Meta-rules,” in K. Sparck-Jones, and Y. Wilks, eds. Automatic Natural Language Processing, John Wiley and Sons, New York, New York.
Kay, Martin (1987) “Nonconcatenative Finite-State Morphology,” paper presented at a workshop on Arabic Morphology, Stanford University, Stanford, California.
Koskenniemi, Kimmo (1983) Two-level Morphology: A General Computational Model for Word-form Recognition and Production. Publication No. 11 of the University of Helsinki Department of General Linguistics, Helsinki, Finland.
Koskenniemi, Kimmo (1983) “Two-level Model for Morphological Analysis,” IJCAI 83, pp. 683685.
Koskenniemi, Kimmo (1984) “A General Computational Model for Word-form Recognition and Production,” COLING 84, pp. 178–181.
Schane, Sanford (1973) Generative Phonology, Prentice Hall, Englewood Cliffs, New Jersey.
Selkirk, Elizabeth (1982) The Syntax of Words, MIT Press, Cambridge, Massachussetts.
Shieber, Stuart (1986) An Introduction to Unification-Based Approaches to Grammar, CSLI Lecture Notes Series, Stanford University, Stanford, California.
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
Bear, J. (1988). Generation and Recognition of Inflectional Morphology. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-73998-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50180-0
Online ISBN: 978-3-642-73998-9
eBook Packages: Springer Book Archive