A morphological recognizer with syntactic and phonological rules
COLING '86 Proceedings of the 11th coference on Computational linguistics
Morphology with a null-interface
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
We use the more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which has been overlooked in favor of implementation issues using the finite state paradigm, namely, that a mathematical relation can be specified between the lexical and surface levels of a language. Relations, whether finite state or not, can be computed using any of several paradigms, and we present a logical reading of a notation for relational morphological rules (similar to that of Koskenniemi's) which can in fact be used to automatically generate Prolog program clauses. Like the finite state implementations, the relation can be computed in either direction, either from the surface to the lexieal level, or vice versa. At rite very least, this provides a morphological complement to logic grammars which deal mainly with syntax and semantics, in a programming environment which is more user-friendly than the finite state programming paradigm. The morphological rules often compile simply into unification of the arguments in the generated morphology predicate followed by a recursive call of the said predicate. Further speed can be obtained when a Prolog compiler, rather than an interpreter, is used for execution.