Proceedings of the 10th International Conference on Computational Linguistics - 1984
DOI: 10.3115/980431.980529
|View full text |Cite
|
Sign up to set email alerts
|

A general computational model for word-form recognition and production

Abstract: A language independent model for recognition and production of word forms is presented. This "two-level model" is based on a new way of describing morphological alternations. All rules describing the morphophonological variations are parallel and relatively independent of each other. Individual rules are implemented as finite state automata, as in an earlier model due to Martin Kay and Ron Kaplan. The two-level model has been implemented as an operational computer programs in several places. A number of operat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
280
0
9

Year Published

2000
2000
2011
2011

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 292 publications
(289 citation statements)
references
References 0 publications
0
280
0
9
Order By: Relevance
“…The two-level model of morphology (Koskenniemi, 1983) has been extremely successful in manually capturing the morphological processes of the world's languages. The context sensitive stem-change models used in this current paper have been partially inspired by this framework.…”
Section: Related Workmentioning
confidence: 99%
“…The two-level model of morphology (Koskenniemi, 1983) has been extremely successful in manually capturing the morphological processes of the world's languages. The context sensitive stem-change models used in this current paper have been partially inspired by this framework.…”
Section: Related Workmentioning
confidence: 99%
“…Reference morpheme sequences for the words are obtained using existing software for automatic morphological analysis based on the two-level morphology of Koskenniemi (1983). For each word form, the analyzer outputs the base form of the word together with grammatical tags.…”
Section: Discussionmentioning
confidence: 99%
“…Use language rules which are programmed in a finite state transducer (FST). Koskenniemi proposed a two-level morphology system for language morphology which led to Antworth's two-level morphology system PC-KIMMO [9] [19]. Later, Beesley and Buckwalter developed an Arabic morphology system ALPNET that uses a slightly enhanced implementation of PC-KIMMO [10].…”
Section: Introductionmentioning
confidence: 99%