TAILIEUCHUNG - Báo cáo khoa học: "Constraint-based Sentence Compression An Integer Programming Approach"

The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an optimisation problem. We develop an integer programming formulation and infer globally optimal compressions in the face of linguistically motivated constraints. We show that such a formulation allows for relatively simple and knowledge-lean compression models that do not require parallel corpora or largescale resources. The proposed approach yields results comparable and in some cases superior to state-of-the-art. . | Constraint-based Sentence Compression An Integer Programming Approach James Clarke and Mirella Lapata School of Informatics University of Edinburgh 2 Bucclecuch Place Edinburgh Eh8 9LW UK jclarke@ mlap@ Abstract The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an optimisation problem. We develop an integer programming formulation and infer globally optimal compressions in the face of linguistically motivated constraints. We show that such a formulation allows for relatively simple and knowledge-lean compression models that do not require parallel corpora or large-scale resources. The proposed approach yields results comparable and in some cases superior to state-of-the-art. 1 Introduction A mechanism for automatically compressing sentences while preserving their grammaticality and most important information would greatly bene-ht a wide range of applications. Examples include text summarisation Jing 2000 subtitle generation from spoken transcripts Vandeghinste and Pan 2004 and information retrieval Olivers and Dolan 1999 . Sentence compression is a complex paraphrasing task with information loss involving substitution deletion insertion and reordering operations. Recent years have witnessed increased interest on a simpler instantiation of the compression problem namely word deletion Knight and Marcu 2002 Riezler et al. 2003 Turner and Char-niak 2005 . More formally given an input sentence of words W W1 w2 . wn a compression is formed by removing any subset of these words. Sentence compression has received both generative and discriminative formulations in the literature. Generative approaches Knight and Marcu 2002 Turner and Charniak 2005 are instantiations of the noisy-channel model given a long sentence l the aim is to hnd the corresponding short sentence s which maximises the conditional probability P s l . In a .

• Báo cáo khoa học
• Constraint based
• Sentence Compression
• Integer Programming Approach
• 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