tailieunhanh - Báo cáo khoa học: "Semitic Morphological Analysis and Generation Using Finite State Transducers with Feature Structures"

This paper presents an application of finite state transducers weighted with feature structure descriptions, following Amtrup (2003), to the morphology of the Semitic language Tigrinya. It is shown that feature-structure weights provide an efficient way of handling the templatic morphology that characterizes Semitic verb stems as well as the long-distance dependencies characterizing the complex Tigrinya verb morphotactics. A relatively complete computational implementation of Tigrinya verb morphology is described. . | Semitic Morphological Analysis and Generation Using Finite State Transducers with Feature Structures Michael Gasser Indiana University School of Informatics Bloomington Indiana USA gasser@ Abstract This paper presents an application of finite state transducers weighted with feature structure descriptions following Amtrup 2003 to the morphology of the Semitic language Tigrinya. It is shown that feature-structure weights provide an efficient way of handling the templatic morphology that characterizes Semitic verb stems as well as the long-distance dependencies characterizing the complex Tigrinya verb morphotactics. A relatively complete computational implementation of Tigrinya verb morphology is described. 1 Introduction Finite state morphology Morphological analysis is the segmentation of words into their component morphemes and the assignment of grammatical morphemes to grammatical categories and lexical morphemes to lexemes. For example the English noun parties could be analyzed as party PLURAL. Morphological generation is the reverse process. Both processes relate a surface level to a lexical level. The relationship between these levels has concerned many phonologists and morphologists over the years and traditional descriptions since the pioneering work of Chomsky and Halle 1968 have characterized it in terms of a series of ordered content-sensitive rewrite rules which apply in the generation but not the analysis direction. Within computational morphology a very significant advance came with the demonstration that phonological rules could be implemented as finite state transducers Johnson 1972 Kaplan and Kay 1994 FSTs and that the rule ordering could be dispensed with using FSTs that relate the surface and lexical levels directly Koskenniemi 1983 . Because of the invertibility of FSTs two-level phonology and morphology permitted the creation of systems of FSTs that implemented both analysis surface input lexical output and generation lexical input

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.