TAILIEUCHUNG - Báo cáo khoa học: "Enforcing Transitivity in Coreference Resolution"

A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being coreferent with each of two other mentions, it will also consider the likelihood of those two mentions being coreferent when making a final assignment. This is exactly the kind of constraint that integer linear programming (ILP) is ideal for, but, surprisingly, previous work applying ILP to coreference resolution has not encoded this type of constraint. We train a coreference classifier over pairs of mentions, and show how to encode this type. | Enforcing Transitivity in Coreference Resolution Jenny Rose Finkel and Christopher D. Manning Department of Computer Science Stanford University Stanford CA 94305 j rfinkel manning @ Abstract A desirable quality of a coreference resolution system is the ability to handle transitivity constraints such that even if it places high likelihood on a particular mention being coreferent with each of two other mentions it will also consider the likelihood of those two mentions being coreferent when making a final assignment. This is exactly the kind of constraint that integer linear programming ILP is ideal for but surprisingly previous work applying ILP to coreference resolution has not encoded this type of constraint. We train a coreference classifier over pairs of mentions and show how to encode this type of constraint on top of the probabilities output from our pairwise classifier to extract the most probable legal entity assignments. We present results on two commonly used datasets which show that enforcement of transitive closure consistently improves performance including improvements of up to using the b3 scorer and up to using cluster f-measure. 1 Introduction Much recent work on coreference resolution which is the task of deciding which noun phrases or mentions in a document refer to the same real world entity builds on Soon et al. 2001 . They built a decision tree classifier to label pairs of mentions as coreferent or not. Using their classifier they would build up coreference chains where each mention was linked up with the most recent previous mention that the classifier labeled as coreferent if such a mention existed. Transitive closure in this model was done implicitly. If John Smith was labeled coreferent with Smith and Smith with Jane Smith then John Smith and Jane Smith were also coreferent regardless of the classifier s evaluation of that pair. Much work that followed improved upon this strategy by improving the features Ng and .

• Báo cáo khoa học
• Enforcing Transitivity
• Coreference Resolution
• Jenny Rose Finkel and Christopher D
• Manning
• báo cáo khoa học
• báo cáo 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 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