TAILIEUCHUNG - Báo cáo khoa học: "A GENERAL COMPUTATIONAL MODEL FOR WORD-FORM RECOGNITION AND PRODUCTION"

A language independent m o d e l for r e c o g n i t i o n and p r o d u c t i o n of w o r d f o r m s is p r e s e n t e d . T h i s " t w o - l e v e l m o d e l " is based on a new w a y of d e s c r i b i n g m o r p h o logical alternations | A GENERAL COMPUTATIONAL MODEL FOR WORD-FORM RECOGNITION AND PRODUCTION Kimmo Koskenniemi Department of General Linguistics Univeristy of Helsinki Hallituskatu 11-13 Helsinki 10 Finland 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 operational two-level descriptions have been written or are in progress Finnish English Japanese Rumanian French Swedish Old Church Slavonic Greek Lappish Arabic Icelandic . The model is bidirectional and it is capable of both analyzing and synthesizing word-forms. 1. Generative phonology The formalism of generative phonology has been widely used since its introduction in the 1960 s. The morphology of any language may be described with the formalism by constructing a set of rewriting rules. The rules start from an underlying lexical representation and transform it step by step until the surface representation is reached. The generative formalism is unidirectional and it has proven to be computationally difficult and therefore it has found little use in practical morphological programs. 2. The model of Kay and Kaplan Martin Kay and Ron Kaplan from Xerox PARC noticed that each of the generative rewriting rules can be represented by a finite state automaton or transducer Kay 1982 . Such an automaton would compare two successive levels of the generative framework the level immediately The work described in this paper is a part of the project 593 sponsored by the Academy of Finland. before application of the rule and the level after application of the rule. The whole morphological .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã 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.