Two-level model for morphological analysis

Authors:
Kimmo Koskenniemi
Affiliations:
University of Helsinki, Department of General Linguistics, Helsinki, Finland
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 0
Cited 8

A Testing Framework for Finite-State Morphology

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Feature structures, unification and finite-state transducers

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
The Karamel system and semitic languages: structured multi-tiered morphology

Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
An active learning process for extraction and standardisation of medical measurements by a trainable FSA

CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
Intersection of multitape transducers vs. cascade of binary transducers: the example of Egyptian Hieroglyphs transliteration

FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
A morphological analyzer using hash tables in main memory (MAHT) and a lexical knowledge base

CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
On the learnability of shuffle ideals

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
On the learnability of shuffle ideals

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new linguistic, computationally implemented model for morphological analysis and synthesis. It is general in the sense that the same language independent algorithm and the same computer program can operate on a wide range of languages, including highly inflected ones such as Finnish, Russian or Sanskrit. The new model is unrestricted in scope and it is capable of handling the whole language system as well as ordinary running text. A full description for Finnish has been completed and tested, and the entries in the Dictionary of Modern Standard Finnish have been converted into a format compatible with it. The model is based on a lexicon that defines the word roots, inflectional morphemes and certain nonphonological alternation patterns, and on a set of parallel rules that define phonologically oriented phenomena. The rules are implemented as parallel finite state automata, and the same description can be run both in the producing and in the analyzing direction.