tailieunhanh - Báo cáo khoa học: "TWO THEORIES FOR COMPUTING THE LOGICAL FORM OF MASS EXPRESSIONS"

There are various difficulties in accomodating the traditional mass/count distinction into a grammar for English which has a goal the production of "logical form" semantic translations of the initial English sentences, The present paper surveys some of these difficulties. One puzzle is whether the distinction is a syntactic one or a semantic one, ., whether it is a well-formedness constraint or whether it is a description of the semantic translations produced. Another puzzle is whether it should be applied to simple words (as they occur in the lexicon) or whether it should apply only to longer units (such. | TWO THEORIES FOR COMPUTING THE LOGICAL FORM OF MASS EXPRESSIONS Francis Jeffry Pelletier Lenhart K. Schubert Dept. Computing Science University of Alberta Edmonton Alberta T6G 2E1 Canada ABSTRACT There are various difficulties in accomodating the traditional mass count distinction into a grammar for English which has a goal the production of logical form semantic translations of the initial English sentences. The present paper surveys some of these difficulties. One puzzle is whether the distinction is a syntactic one or a semantic one . whether it is a well-formedness consttaint or whether it is a description of the semantic translations produced. Another puzzle is whether it should be applied to simple words as they occur in the lexicon or whether it should apply only to longer units such as entire NPs . Of the wide variety of possible theories only two seem to produce the required results having to do with plausible inferences and intuitively satisfying semantic representations . These two theories are developed and compared. According to Montague Thomason 1974 Gazdar Gazdar et al 1984 and a rapidly growing number of linguists philosophers and Al researchers the logical form underlying sentences of a natural language are systematically--and simply--determined by the syntactic form of those sentences. This view is in contrast with a tacit assumption often made in Al that computation of logical translations requires throngs of more or less arbitrary rules operating upon syntactic The following are a few grammar rules in approximately the style of Gazdar s Generalized Phrase Structure Grammar GPSG . They differ from Gazdar s primarily in that they are designed to produce more or less conventional logical translations rather than the intensional ones of Montague and Gazdar for details see Schubert Pelletier 1982 . Each rule consists of a rule number a phrase structure rule and a semantic logical translation rule. 1. s NP VP VP NF 2. VP V be PRED PRED 3. .

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.