TAILIEUCHUNG - Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR"

We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm - - goal-driven bottom-up derivation, tabulation of the partial results, and agenda control mechanism - - and report the results of the preliminary experiments, which show how these features improve the computational efficiency of cost-based abduction. | GENERALIZED CHART ALGORITHM AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION Yasuharu Den ATR Interpreting Telecommunications Research Laboratories 2-2 Hikaridai Seika-cho Soraku-gun Kyoto 619-02 JAPAN Tel 81-7749-5-1328 Fax 81-7749-5-1308 e-mail den@ Abstract We present an efficient procedure for cost-based abduction which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm goal-driven bottom-up derivation tabulation of the partial results and agenda control mechanism and report the results of the preliminary experiments which show how these features improve the computational efficiency of cost-based abduction. Introduction Spoken language understanding is one of the most challenging research areas in natural language processing. Since spoken language is incomplete in various ways . containing speech errors ellipsis metonymy etc. spoken language understanding systems should have the ability to process incomplete inputs by hypothesizing the underlying information. The abduction-based approach Hobbs et al. 1988 has provided a simple and elegant way to realize such a task. Consider the following Japanese sentence 1 Sóseki kat- ta a famous writer buy PAST This sentence contains two typical phenomena arising in spoken language . metonymy and the ellipsis of a particle. When this sentence is uttered under the situation where the speaker reports his experience its natural interpretation is the speaker bought a Sôseki novel. To derive this interpretation we need to resolve the following problems The metonymy implied by the noun phrase Sóseki is expanded to a Sôseki novel based on the pragmatic knowledge that the name of a writer is sometimes used to refer to his novel. The particle-less thematic relation between the verb katta and the noun phrase Sôseki is determined to be the object case relation based on the semantic knowledge that the object case relation between a trading action and a

• Báo cáo khoa học
• GENERALIZED CHART ALGORITHM
• AN EFFICIENT PROCEDURE
• COST BASED ABDUCTION ATR
• 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