tailieunhanh - Báo cáo khoa học: "PHRASE STRUCTURE TREES BEAR MORE FRUIT THAN YOU WOULD HAVE THOUGHT"

There is renewed interest in examining the descriptive as well as generative power of phrase s~-~uctur~ grammars. The primary motivation has come from the recent investigations in alternatives to t-~ansfor~ational gremmmrs [., i, 2, 3, 4]. We will present several results and ideas related to phrase structure trees which have significant relevance to computational linguistics. We %~_nT to accomplish several objectives in this paper. I. We will give a hrief survey of some recent results and approaches by various investigators including, of course, our own work~ indicating their interr~laticnand Leon "S."Levy Bell Telephone Laboratories Whippany | PHRASE STRUCTURE TREES BEAR MORE FRUIT THAN YOU WOULD HAVE THOUGHT Aravind K. Joshi and Department of Computer and Infonration Science The Moore School D2 University of Pennsylvania Philadelphia PA 19104 Leon s. Levy Bell Telephone Laboratories Whippany NJ 07981 EXTENDED ABSTRACT There is renewed interest in examining the descriptive as well as generative power of phrase structure grammars. The primary motivation has come from the recent investigations in alternatives to transformational granmars . 1 2 3 4 . We will present several results and ideas related to phrase structure trees which have significant relevance to computational linguistics . We want to accomplish several objectives in this paper. 1. We will give a brief survey of some recent results and approaches by various investigators including of course our own work indicating their interrelationships. Here we will review the work related to the notion of node admissibility starting with Chomsky follovred by the work by McCawley Peters and Ritchie Joshi and Levy and more recent work of Gazdar. We will also discuss other amendments to context-free granmars which increase the descriptive power but not the generative power. In particular we will discuss the notion of categories with holes as recently introduced by Gazdar 3J. There is an interesting history behind this notion. Sager s parser explicitly exploits such a convention and in fact uses it to do some coordinate structure computation. We suspect that some other parsers have this feature also perhaps implicitly. We will discuss this matter which obviously is of great interest to computational linguists. 2. Our work on local constraints on structural descriptions 5 6 which is computationally relevant both to linguistics and programming language theory has attracted some attention recently however the demonstration of these results has remained somewhat inaccessible to many due to the technicalities of the tree automata theory. Recently we have found a

TỪ KHÓA LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
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.