TAILIEUCHUNG - Báo cáo khoa học: "FEATURE LOGIC WITH WEAK CONSTRAINTS SUBSUMPTION"

In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to describe linguistic objects. We investigate the extension of basic feature logic with subsumption (or matching) constraints, based on a weak notion of subsumption. This mechanism of oneway information flow is generally deemed to be necessary to give linguistically satisfactory descriptions of coordination phenomena in such formalisms. We show that the problem whether a set of constraints is satisfiable in this logic is decidable in polynomial time and give a solution algorithm. be informally described as a device,. | FEATURE LOGIC WITH WEAK SUBSUMPTION CONSTRAINTS Jochen Dõr re IBM Deutschland GmbH Science Center - IKBS . Box 80 08 80 D-7000 Stnttgart 80 Germany ABSTRACT In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to describe linguistic objects. We investigate the extension of basic feature logic with subsumption or matching constraints based on a weak notion of subsumption. This mechanism of oneway information flow is generally deemed to be necessary to give linguistically satisfactory descriptions of coordination phenomena in such formalisms. We show that the problem whether a set of constraints is satlsfiable in this logic is decidable in polynomial time and give a solution algorithm. 1 Introduction Many of the current constraint-based grammar formalisms as . FUG Kay 79 Kay 85 LFG Kaplan Bresnan 82 HPSG Pollard Sag 87 PATR-II Shieber et al. 83 and its derivates model linguistic knowledge in recursive feature structures. Feature or functional equations as in LFG or feature terms as in FUG or STUF Bouma et al. 88 are used as constraints to describe declaratively what properties should be assigned to a linguistic entity. In the last few years the study of the formal semantics and formal properties of logics involving such constraints has made substantial progress Kasper Rounds 86 Johnson 87 Smolka 88 Smolka 89 . by making precise which sublanguages of predicate logic it corresponds to. This paves the way not only for reliable implementations of these formalisms but also for extensions of the basic logic with a precisely defined meaning. The extension we present here weak subsumption constraints is a mechanism of one-way information flow often proposed for a logical treatment of coordination in a feature-based unification It can 1 Another application would be type inference in a grammar formalism or programming language that be informally described as a device which enables

• Báo cáo khoa học
• FEATURE LOGIC
• WEAK CONSTRAINTS SUBSUMPTION
• Jochen Dbere
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Balancing Clarity
• Efficiency in Typed Feature
• Logic through Delaying
• INCORPORATING INHERITANCE
• FEATURE STRUCTURES
• A LOGIC GRAMMAR FORMALISM
• scientific reports
• model language
• process natural language
• EXPRESSING DISJUNCTIVE
• NEGATIVE FEATURE
• CONSTRAINTS CLASSICAL FIRST ORDER LOGIC
• Interleaving Universal Principles
• Relational Constraints
• Typed Feature Logic
• Information and communication technology
• Fuzzy unordered rule
• Greedy hill climbing feature selection method
• Support vector machine
• Fuzzy logic
• 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