tailieunhanh - Báo cáo khoa học: "Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach"

While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of wellformedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators. | Generating with a Grammar Based on Tree Descriptions a Constraint-Based Approach Claire Gardent CNRS LORIA BP 239 Campus Scientifique 54506 Vandoeuvre-les-Nancy France Abstract While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps the axiomatic view eliminates invalid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat semantics this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators. 1 Introduction We take the axiomatic view of language and show that it yields an interestingly new perspective on the tactical generation task . the task of producing from a given semantics a string with semantics . As Cornell and Rogers To appear clearly shows there has recently been a surge of interest in logic based grammars for natural language. In this branch of research sometimes referred to as Model Theoretic Syntax a grammar is viewed as a set of axioms defining the well-formed structures of natural language. The motivation for model theoretic grammars is initially theoretical the use of logic should support both a more precise formulation of grammars and a different perspective on the mathematical and computational properties of natural language. But eventually the question must also be addressed of how such grammars could be put to work. One obvious answer is to use a model generator. Given a logical formula a model genera- Stefan Thater Computational Linguistics Universitat des Saarlandes Saarbriicken Germany stth@ tor is a program which builds some of the models satisfying this formula. Thus for parsing a model generator can be used to enumerate the minimal model s that is the parse trees satisfying the conjunction of the lexical categories selected on the basis

• Báo cáo khoa học
• Generating with a Grammar
• Based on Tree Descriptions
• a Constraint Based Approach
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Alternative Approaches
• Generating Bodies of Grammar Rules
• Gabriel Infante Lopez and Maarten de Rijke
• Generating referring expressions
• a unification grammar
• Richard Power
• scientific reports
• model language
• process natural language
• 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