TAILIEUCHUNG - Báo cáo khoa học: "Translating a Unification Grammar with Disjunctions into Logical Constraints"

This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective to translate unification grammar formalism based on path equations and lists of pairs of labels and values into a term-based internal representation. . | Translating a Unification Grammar with Disjunctions into Logical Constraints Mikio Nakano and Akira Shimazu NTT Basic Research Laboratories 3-1 Morinosato-Wakamiya Atsugi 243-0198 Japan E-mail nakano@ shimazu@ Abstract This paper proposes a method for generating a logical-constraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore it is effective to translate unification grammar formalism based on path equations and lists of pairs of labels and values into a term-based internal representation. Previous translation methods cannot deal with disjunctive feature descriptions which reduce redundancies in the grammar and make parsing efficient. Since the proposed method translates a formalism without expanding disjunctions parsing with the resulting representation is efficient. 1 Introduction The objective of our research is to build a natural language understanding system that is based on unification. The reason we have chosen a unification-based approach is that it enables US to describe grammar declaratively making the development and amendment of grammar easy. Analysis systems that are based on unification grammars can be classified into two groups from the viewpoint of the ways feature structures are represented a those using labeled directed graphs Shieber 1984 and b those using first-order terms Pereira and Warren 1980 Matsumoto et al. 1983 Tokunaga et al. 1991 . In addition to internal representation grammar formalisms can be classified into two groups i those that describe feature structures with path equations and lists of pairs of labels and values Mukai and .

• Báo cáo khoa học
• Translating a Unification
• Grammar with Disjunctions
• Logical Constraints
• 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