The logic of typed feature structures
The logic of typed feature structures
Feature-based inheritance networks for computational lexicons
Inheritance, defaults and the lexicon
Phonological analysis in typed feature systems
Computational Linguistics - Special issue on computational phonology
Learning from texts - a terminological metareasoning perspective
Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
Coping with derivation in a morphological component
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Processing unknown words in HPSG
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Automatic acquisition of subcategorization frames from untagged text
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
We present an approach to the incremental accrual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. Although the techniques are language-independent and can be applied to all kinds of information, in this paper we concentrate on the domain of German noun inflection. We show how morphological information, especially inflectional class, is successfully acquired using a type-based HPSG-like analysis. Furthermore, we sketch an alternative strategy which makes use of finite-state transducers.