TAILIEUCHUNG - Báo cáo khoa học: "Analysis of Syntax-Based Pronoun Resolution Methods"

This paper presents a pronoun resolution algorithm that adheres to the constraints and rules of Centering Theory (Grosz et al., 1995) and is an alternative to Brennan et al.'s 1987 algorithm. The advantages of this new model, the Left-Right Centering Algorithm (LRC), lie in its incremental processing of utterances and in its low computational overhead. The algorithm is compared with three other pronoun resolution methods: Hobbs' syntax-based algorithm, Strube's S-list approach, and the B F P Centering algorithm. . | Analysis of Syntax-Based Pronoun Resolution Methods Joel R. Tetreault University of Rochester Department of Computer Science Rochester NY 14627 Abstract This paper presents a pronoun resolution algorithm that adheres to the constraints and rules of Centering Theory Grosz et al. 1995 and is an alternative to Brennan et al. s 1987 algorithm. The advantages of this new model the Left-Right Centering Algorithm LRC lie in its incremental processing of utterances and in its low computational overhead. The algorithm is compared with three other pronoun resolution methods Hobbs syntax-based algorithm Strube s S-list approach and the BFP Centering algorithm. All four methods were implemented in a system and tested on an annotated subset of the Treebank corpus consisting of 2026 pronouns. The noteworthy results were that Hobbs and LRC performed the best. 1 Introduction The aim of this project is to develop a pronoun resolution algorithm which performs better than the Brennan et al. 1987 algorithm1 as a cognitive model while also performing well empirically. A revised algorithm Left-Right Centering was motivated by the fact that the BFP algorithm did not allow for incremental processing of an utterance and hence of its pronouns and also by the fact that it occasionally imposes a high computational load detracting from its psycholinguistic plausibility. A second motivation for the project is to remedy the dearth of empirical results on pronoun resolution methods. Many small comparisons of methods have been made such as by Strube 1998 and Walker 1989 but those usually consist of statistics based on a small hand-tested corpus. The problem with evaluating 1 Henceforth BFP algorithms by hand is that it is time consuming and difficult to process corpora that are large enough to provide reliable broadly based statistics. By creating a system that can run algorithms one can easily and quickly analyze large amounts of data and generate more reliable results.

• Báo cáo khoa học
• Analysis of Syntax Based
• Pronoun Resolution Methods
• Long Papers
• 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