tailieunhanh - Báo cáo khoa học: "Models for Sentence Compression: A Comparison across Domains, Training Requirements and Evaluation Measures"

Sentence compression is the task of producing a summary at the sentence level. This paper focuses on three aspects of this task which have not received detailed treatment in the literature: training requirements, scalability, and automatic evaluation. We provide a novel comparison between a supervised constituentbased and an weakly supervised wordbased compression algorithm and examine how these models port to different domains (written vs. spoken text). To achieve this, a human-authored compression corpus has been created and our study highlights potential problems with the automatically gathered compression corpora currently used. . | Models for Sentence Compression A Comparison across Domains Training Requirements and Evaluation Measures James Clarke and Mirella Lapata School of Informatics University of Edinburgh 2 Bucclecuch Place Edinburgh Eh8 9LW UK jclarke@ mlap@ Abstract Sentence compression is the task of producing a summary at the sentence level. This paper focuses on three aspects of this task which have not received detailed treatment in the literature training requirements scalability and automatic evaluation. We provide a novel comparison between a supervised constituentbased and an weakly supervised wordbased compression algorithm and examine how these models port to different domains written vs. spoken text . To achieve this a human-authored compression corpus has been created and our study highlights potential problems with the automatically gathered compression corpora currently used. Finally we assess whether automatic evaluation measures can be used to determine compression quality. 1 Introduction Automatic sentence compression has recently attracted much attention in part because of its affinity with summarisation. The task can be viewed as producing a summary of a single sentence that retains the most important information while remaining grammatically correct. An ideal compression algorithm will involve complex text rewriting operations such as word reordering paraphrasing substitution deletion and insertion. In default of a more sophisticated compression algorithm current approaches have simplified the problem to a single rewriting operation namely word deletion. More formally given an input sentence of words W W1 w2 . wn a compression is formed by dropping any subset of these words. Viewing the task as word removal reduces the number of possible compressions to 2n naturally many of these compressions will not be reasonable or grammatical Knight and Marcu 2002 . Sentence compression could be usefully employed in wide range of applications. For example .

• Báo cáo khoa học
• Models for Sentence Compression
• A Comparison across Domains
• Training Requirements
• Evaluation Measures
• 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