Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A morphological recognizer with syntactic and phonological rules
COLING '86 Proceedings of the 11th coference on Computational linguistics
A dictionary and morphological analyser for English
COLING '86 Proceedings of the 11th coference on Computational linguistics
Languages generated by two-level morphological rules
Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
ARIES: A lexical platform for engineering Spanish processing tools
Natural Language Engineering
XUXEN: a spelling checker/corrector for basque based on two-level morphology
ANLC '92 Proceedings of the third conference on Applied natural language processing
On the generative power of two-level morphological rules
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A unified management and processing of word-forms, idioms and analytical compounds
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Analysis of unknown words through morphological decomposition
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Automatic learning of word transducers from examples
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Hi-index | 0.00 |
To achieve generality, natural language parsers require dictionaries which handle lexical information in a linguistically motivated but computationally viable manner. Various rule formalisms are presented which process orthographic effects, word structure, and lexicai redundancy in a manner which allows the statement of linguistic generalisations with a clear computational interpretation. A compact description of a medium-sized subset of the English lexicon can be stated using these formalisms. The proposed mechanisms have been implemented and tested, but require to be refined further if they are to be regarded as an interesting linguistic theory.