TAILIEUCHUNG - Báo cáo khoa học: "CONNECTION RELATIONS AND QUANTIFIER SCOPE"

A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with regard to quantifier scope. The scope d e t e r m i n a t i o n results in e x t e n d i n g this representation with additional context and world k n o w l e d g e conditions. If there is no scope determining information, the formalism can work further with this scope-ambiguous representation. Thus scope information does not have to. | Connection relations and Quantifier Scope Longin Latecki University of Hamburg Department of Computer Science Bodenstedtstr. 16 2000 Hamburg 50 Germany e-mail latecki@ ABSTRACT A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with regard to quantifier scope. The scope determination results in extending this representation with additional context and world knowledge conditions. If there is no scope determining information the formalism can work further with this scope-ambiguous representation. Thus scope information does not have to be completely determined. 0. INTRODUCTION Many natural language sentences have more than one possible reading with regard to quantifier scope. The most widely used methods for scope determination generate all possible readings of a sentence with regard to quantifier scope by applying all quantifiers which occur in the sentence in all combinatorically possible sequences. These methods do not make use of the inner structure and meaning of a quantifier. At best quantifiers are constrained by external conditions in order to eliminate some scope relations. The best known methods are determination of scope in LF in GB May 1985 Cooper Storage Cooper 1983 Keller 1988 and the algorithm of Hobbs and Shieber Hobbs Shieber 1987 . These methods assign for instance six possible readings to a sentence with three quantifiers. Using these methods a sentence must be disambiguated in order to receive a semantic representation. This means that a scope-ambiguous sentence necessarily has several semantic representations since the formalisms for the representation do not allow for scope-ambiguity. It is hard to imagine that human beings disambiguate scope-ambiguous sentences in the same way. The generation of all possible combinations of sequences of quantifiers and the assignment of these sequences to .

• Báo cáo khoa học
• CONNECTION RELATIONS
• QUANTIFIER SCOPE
• Long in Latecki
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Q classical orthogonal polynomials
• Askey–Wilson polynomials
• Q difference equations
• Fourier coefficients
• Recurrence relations
• Connection problem
• Relationship between Employee and Customer
• Personal connection
• Word of Mouth
• Exploratory Factor Analysis
• Cronbach Alpha analysis
• 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