TAILIEUCHUNG - Báo cáo khoa học: "An Incremental Connectionist Phrase Structure Parser"

This abstract outlines a parser implemented in a connectionist model of short term memory and reasoning 1. This connectionist architecture, proposed by Shastri in [Shastri and Ajjanagadde, 1990], preserves the symbolic interpretation of the information it stores and manipulates, but does its computations with nodes which have roughly the same computational properties as neurons. The parser recovers the phrase structure of a sentence incrementally from beginning to end and is intended to be a plausible model of human sentence processing. . | An Incremental Connectionist Phrase Structure Parser James Henderson Ư. of Pennsylvania Dept of Computer and Information Science 200 South 33rd Philadelphia PA 19104 1 Introduction This abstract outlines a parser implemented in a con-nectionist model of short term memory and reasoning 1. This connectionist architecture proposed by Shastri in Shastri and Ajjanagadde 1990 preserves the symbolic interpretation of the information it stores and manipulates but does its computations with nodes which have roughly the same computational properties as neurons. The parser recovers the phrase structure of a sentence incrementally from beginning to end and is intended to be a plausible model of human sentence processing. The formalism which defines the grammars for the parser is expressive enough to incorporate analyses from a wide variety of grammatical investigations2. This combination gives a theory of human syntactic processing which spans from the level of linguistic theory to the level of neuron computations. 2 The Connectionist Architecture In order to store and manipulate information in a con-nectionist net quickly the information needs to be represented in the activation of nodes not the connections between nodes3. A property of an entity can be represented by having a node for the entity and a node for the property both active at the same time. However this only permits information about one entity to be stored at any one time. The connectionist architecture used here solves this problem with nodes which when active fire at regular intervals. A property is predicated of an entity only if their nodes are firing syn This research was supported by DARPA grant number N0014-90-J-1863 and ARO grant number DAAL03-89-C0031PRI. 1As of this writing the parser has been designed but not coded. 2 A paper about a closely related formalism was submitted to this year s regular ACL session under the title A CCG-Like System of Types for Trees and an older version of the later was .

• Báo cáo khoa học
• An Incremental Connectionist
• Phrase Structure Parser
• James Henderson
• 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