TAILIEUCHUNG - Báo cáo khoa học: "Two Accounts of Scope Availability and Semantic Underspecification"

We propose a formal system for representing the available readings of sentences displaying quantifier scope ambiguity, in which partial scopes may be expressed. We show that using a theory of scope availability based upon the functionargument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading, while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard. | Two Accounts of Scope Availability and Semantic Underspecification Alistair Willis and Suresh Manandhar Department of Computer Science University of York York Y010 5DD UK. agw suresh @ Abstract We propose a formal system for representing the available readings of sentences displaying quantifier scope ambiguity in which partial scopes may be expressed. We show that using a theory of scope availability based upon the functionargument structure of a sentence allows a deterministic polynomial time test for the availability of a reading while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard. 1 Introduction The phenomenon of quantifier scope ambiguity has been discussed extensively within computational and theoretical linguistics. Given a sentence displaying quantifier scope ambiguity such as Every man loves a woman part of the problem of representing the sentence s meaning is to distinguish between the two possible meanings Vx man x 3y woman y hlove x y Ỵ where every man loves a possibly different woman or By woman y Vx man x Zove x y where a single woman is loved by every man. One aspect of the problem is the generation of all available readings in a suitable representation language. Cooper 1983 described a system of storing the quantifiers as A-expressions during the parsing process and retrieving them at the sentence level different orders of quantifier retrieval generate different readings of the sentence. However Cooper s method generates logical forms in which variables are not correctly bound by their quantifiers and so do not correspond to a correct sentence meaning. This problem is rectified by nested storage Keller 1986 and the Hobbs and Shieber 1987 algorithm. However the linguistic assumptions underlying these approaches have recently been questioned. Park 1995 has argued that the availability of readings is determined not by the well-formedness of sentences .

• Báo cáo khoa học
• Two Accounts of Scope Availability
• Semantic Underspecification
• Alistair Willis and Suresh Manandhar
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Bài giảng Xử lý ngôn ngữ tự nhiên
• Ngôn ngữ tự nhiên
• Kỹ thuật lập trình
• Xử lý nhập nhằng ngữ nghĩa
• Xử lý ngữ nghĩa
• Xử lý ngôn ngữ
• Natural Language Processing
• Ngôn ngữ lập trình
• Nhập nhằng cấu trúc
• Tri thức về ngôn ngữ
• Mô hình n gram
• Dịch máy
• Phương pháp dịch máy
• Hiểu ngôn ngữ
• Phân tích ngữ nghĩa
• Phân loại tin tự động
• Biểu diễn vị từ
• Thuộc tính về sự kiện
• Thuộc tính về sự kiện
• Mô hình ngôn ngữ Google Book N grams
• Mô hình ngôn ngữ KenLM
• Phương pháp làm mịn
• Tách từ tiếng Việt
• Gán nhãn từ loại
• Phân tích cú pháp
• Nghĩa từ vựng
• Phân giải nhập nhằng từ
• Phân loại văn bản
• Lexical chain
• Phản hồi thông tin
• Bài toán PTCP
• Cấu trúc ngữ pháp
• Phân tích cú pháp xác suất
• CKY kết hợp xác suất
• Văn phạm phi ngữ cảnh xác suất
• Hình thái học