tailieunhanh - Báo cáo khoa học: "AN LR CATEGORY-NEUTRAL PARSER WITH LEFT CORNER PREDICTION"

In this paper we present a new parsing model of linguistic and computational interest. Linguistically, the relation between the paxsez and the theory of grammar adopted (Government and Binding (GB) theory as presented in Chomsky(1981, 1986a,b) is clearly specified. Computationally, this model adopts a mixed parsing procedure, by using left corner prediction in a modified LR parser. | AN LR CATEGORY-NEUTRAL PARSER WITH LEFT CORNER PREDICTION Paola Merlo University of Maryland Universite de Geneve Faculte des Lettres CH-1211 Geneve 4 merlo@ Abstract In this paper we present a new parsing model of linguistic and computational interest. Linguistically the relation between the parser and the theory of grammar adopted Government and Binding GB theory as presented in Chomsky 1981 1986a b is clearly specified. Computationally this model adopts a mixed parsing procedure by using left corner prediction in a modified LR parser. ON LINGUISTIC THEORY For a parser to be linguistically motivated it must be transparent to a linguistic theory under some precise notion of transparency see Abney 1987 . GB theory is a modular theory of abstract principles. A parser which encodes a modular theory of grammar must fulfill apparently contradictory demands for the parser to be explanatory it must maintain the modularity of the theory while for the parser to be efficient modularization must be minimized so that all potentially necessary information is available at all We explore a possible solution to this contradiction. We observe that linguistic information can be classified into 5 different classes as shown in 1 on the basis of their informational content. These we will call IC Classes 1 a. Configurations sisterhood c-command m-command imaximal projection . b. Lexical features N v Funct c-selected Strong Agr . c. Syntactic features Case ớ 7 ibarrier. d. Locality information minimality binding antecedent government. e. Referential information D-linked ianaphor ipronominal. 1 On efficiency of GB-based systems see Ris-tad 1990 Kashkett 1991 . This classification can be used to specify precisely the amount of modularity in the parser. Berwick 1982 400ff shows that a modular system is efficient only if modules that depend on each other are compiled while independent modules are not. We take the notion of dependent and independent to correspond to IC

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.