A computational framework for lexical description
Computational Linguistics - Special issue of the lexicon
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
An efficient implementation of trie structures
Software—Practice & Experience
The UNIX Programming Environment
The UNIX Programming Environment
Morphology in the EUROTRA base level concept
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A finite-state morphological processor for Spanish
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A morphological recognizer with syntactic and phonological rules
COLING '86 Proceedings of the 11th coference on Computational linguistics
Constructing lexical transducers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Monotonic paradigmatic schemata in Italian verb inflection
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
The applicaton of two-level morphology to non-concatenative German morphology
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Inheritance, Defaults and the Lexicon (Studies in Natural Language Processing)
Inheritance, Defaults and the Lexicon (Studies in Natural Language Processing)
| Hi-index | 0.00 |
We present a lexical platform that has been developed for the Spanish language. It achieves portability between different computer systems and efficiency, in terms of speed and lexical coverage. A model for the full treatment of Spanish inflectional morphology for verbs, nouns and adjectives is presented. This model permits word formation based solely on morpheme concatenation, driven by a feature-based unification grammar. The run-time lexicon is a collection of allomorphs for both stems and endings. Although not tested, it should be suitable also for other Romance and highly inflected languages. A formalism is also described for encoding a lemma-based lexical source, well suited for expressing linguistic generalizations: inheritance classes, lemma encoding, morpho-graphemic allomorphy rules and limited type-checking. From this source base, we can automatically generate an allomorph indexed dictionary adequate for efficient retrieval and processing. A set of software tools has been implemented around this formalism: lexical base augmenting aids, lexical compilers to build run-time dictionaries and access libraries for them, feature manipulation libraries, unification and pseudo-unification modules, morphological processors, a parsing system, etc. Software interfaces among the different modules and tools are cleanly defined to ease software integration and tool combination in a flexible way. Directions for accessing our e-mail and web demonstration prototypes are also provided. Some figures are given, showing the lexical coverage of our platform compared to some popular spelling checkers.