Coping with derivation in a morphological component

Authors:
Harald Trost
Affiliations:
Austrian Research Institute for Artificial Intelligence, Wien, Austria
Venue:
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Year:
1993

Citing 6
Cited 2

Recognition and generation of word forms for natural language understanding systems: integrating two-level morphology and feature unification

Applied Artificial Intelligence
Inheritance in natural language processing

Computational Linguistics - Special issue on inheritance: I
A practical approach to multiple default inheritance for unification-based lexicons

Computational Linguistics - Special issue on inheritance: II
Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends

Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 4. Internationaler GI-Kongress Wissensbasierte Systeme
Inference in DATR

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A general computational model for word-form recognition and production

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics

Incremental identification of inflectional types

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Morphology with a null-interface

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level morphology [Trost, 1991a; Trost, 1991b] with a feature-based word grammar building on a hierarchical lexicon. Polymorphemic stems not explicitly stored in the lexicon are given a compositional interpretation. That way the system allows to minimize redundancy in the lexicon because derived words that are transparent need note to be stored explicitly. Also, words formed ad-hoc can be recognized correctly. The system is implemented in CommonLisp and has been tested on examples from German derivation.