TAILIEUCHUNG - Báo cáo khoa học: "Improving Grammaticality in Statistical Sentence Generation: Introducing a Dependency Spanning Tree Algorithm with an Argument Satisfaction Model"

Abstract-like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level syntactic structure. We couch statistical sentence generation as a spanning tree problem in order to search for the best dependency tree spanning a set of chosen words. We also introduce a new search algorithm for this task that models argument satisfaction to improve the linguistic validity of the generated tree. . | Improving Grammaticality in Statistical Sentence Generation Introducing a Dependency Spanning Tree Algorithm with an Argument Satisfaction Model Stephen Wan 1 Mark Dras Robert Dale Centre for Language Technology Department of Computing Macquarie University Sydney NSW 2113 swan madras rdale@ Abstract Abstract-like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence we model a global sentence level syntactic structure. We couch statistical sentence generation as a spanning tree problem in order to search for the best dependency tree spanning a set of chosen words. We also introduce a new search algorithm for this task that models argument satisfaction to improve the linguistic validity of the generated tree. We treat the allocation of modifiers to heads as a weighted bipartite graph matching or assignment problem a well studied problem in graph theory. Using BLEU to measure performance on a string regeneration task we found an improvement illustrating the benefit of the spanning tree approach armed with an argument satisfaction model. 1 Introduction Research in statistical novel sentence generation has the potential to extend the current capabilities of automatic text summarisation technology moving from sentence extraction to abstract-like summarisation. In this paper we describe a new algorithm that improves upon the grammaticality of statistically generated sentences evaluated on a string regeneration task which was first proposed as a surrogate for a grammaticality test by Bangalore et al. 2000 . In this task a system must regenerate the original sentence which has had its word order scrambled. As an evaluation task string regeneration reflects the issues that challenge the sentence generation components of machine translation paraphrase generation and summarisation systems Cecile Paris ICT Centre CSIRO Sydney Australia Soricut and Marcu 2005

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.