TAILIEUCHUNG - Báo cáo khoa học: "TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG"

In this paper the functional uncertainty machinery in L F G is compared with the treatment of long distance dependencies in TAG. It is shown that the functional uncertainty machinery is redundant in TAG, functional uncertainty accomplishes for L F G follows f~om the T A G formalism itself and some aspects of the linguistic theory instantiated in TAG. It is also shown that the analyses provided by the functional uncertainty machinery can be obtained without requiring power beyond mildly context-sensitive grammars. Some linguistic and computational aspects of these results have been briefly discussed also. . | TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG Aravind K. Joshi Dept of Computer Information Science University of Pennsylvania Philadelphia PA 19104 joshi@ K. Vijay-Shanker Dept of Computer Information Science University of Delaware Newark DE 19716 vijay@ ABSTRACT In this paper the functional uncertainty machinery in LFG is compared with the treatment of long distance dependencies in TAG. It is shown that the functional uncertainty machinery is redundant in TAG . what functional uncertainty accomplishes for LFG follows from the TAG formalism itself and some aspects of the linguistic theory instantiated in TAG. It is also shown that the analyses provided by the functional uncertainty machinery can be obtained without requiring power beyond mildly context-sensitive grammars. Some linguistic and computational aspects of these results have been briefly discussed also. 1 INTRODUCTION The so-called long distance dependencies are characterized in Lexical Functional Grammars LFG by the use of the formal device of funciion al uncertainty as defined by Kaplan and Zaenan 3 and Kaplan and Maxwell 2 . In this paper we relate this characterization to that provided by Tree Adjoining Grammars TAG showing a direct correspondence between the functional uncertainty equations in LFG analyses and the elementary trees in TAGs that give analyses for long distance dependencies. We show that the functional uncertainty machinery is redundant in TAG . what functional uncertainty accomplishes for LFG follows from the TAG formalism itself and some fundamental aspects of the linguistic theory instantiated in TAG. We thus show that these analyses can be obtained without requiring power beyond mildly context-sensitive grammars. We also This work was partially supported for the first author by the DARPA grant N00014-85-K0018 ARO grant DAA29-84-9-0027 and NSF grant DU84-10413-A02. The first author also .

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.