TAILIEUCHUNG - Báo cáo khoa học: "Evaluating Automated and Manual Acquisition of Anaphora Resolution Strategies"

We describe one approach to build an automatically trainable anaphora resolution system. In this approach, we use Japanese newspaper articles tagged with discourse information as training examples for a machine learning algorithm which employs the decision tree algorithm by Quinlan (Quinlan, 1993). Then, we evaluate and compare the results of several variants of the machine learning-based approach with those of our existing anaphora resolution system which uses manually-designed knowledge sources. Finally, we compare our algorithms with existing theories of anaphora, in particular, Japanese zero pronouns. . | Evaluating Automated and Manual Acquisition of Anaphora Resolution Strategies Chinatsu Aone and Scott William Bennett Systems Research and Applications Corporation SRA 2000 15th Street North Arlington VA 22201 aonec@ bennett@ Abstract We describe one approach to build an automatically trainable anaphora resolution system. In this approach we use Japanese newspaper articles tagged with discourse information as training examples for a machine learning algorithm which employs the decision tree algorithm by Quinlan Quinlan 1993 . Then we evaluate and compare the results of several variants of the machine learning-based approach with those of our existing anaphora resolution system which uses manually-designed knowledge sources. Finally we compare our algorithms with existing theories of anaphora in particular Japanese zero pronouns. 1 Introduction Anaphora resolution is an important but still difficult problem for various large-scale natural language processing NLP applications such as information extraction and machine translation. Thus far no theories of anaphora have been tested on an empirical basis and therefore there is no answer to the best anaphora resolution Moreover an anaphora resolution system within an NLP system for real applications must handle degraded or missing input no NLP system has complete lexicons grammars or semantic knowledge and outputs perfect results and different anaphoric phenomena in different domains languages and applications. Thus even if there exists a perfect theory it might not work well with noisy input or it would not cover all the anaphoric phenomena. Walker Walker 1989 compares Brennan Friedman and Pollard s centering approach Brennan et al. 1987 with Hobbs algorithm Hobbs 1976 on a theoretical basis. These requirements have motivated US to develop robust extensible and trainable anaphora resolution systems. Previously Aone and McKee 1993 we reported our data-driven multilingual anaphora resolution

• Báo cáo khoa học
• Evaluating Automated
• Manual Acquisition
• Anaphora Resolution Strategies
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Computing
• Evaluating Syntactic Complexity Features for Automated Scoring
• Spontaneous Non Native Speech
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Integrating queuing model
• Technique for Order of Preference
• Similarity to Ideal Solution
• Automated teller machine
• Queuing model cum TOPSIS
• BMC Veterinary Research
• Critically ill horses
• Global hemostatic tests
• Tissue factor
• Platelet poor plasma
• Plasma thromboelastography
• Bài giảng Xử lý 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