TAILIEUCHUNG - Báo cáo khoa học: "Generalized Encoding of Description Spaces and its Application to Typed Feature Structures"

This paper presents a new formalization of a unification- or join-preserving encoding of partially ordered sets that more essentially captures what it means for an encoding to preserve joins, generalizing the standard definition in AI research. It then shows that every statically typable ontology in the logic of typed feature structures can be encoded in a data structure of fixed size without the need for resizing or additional union-find operations. This is important for any grammar implementation or development system based on typed feature structures, as it significantly reduces the overhead of memory management and reference-pointer-chasing during unification. . | Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics ACL Philadelphia July 2002 pp. 64-71. Generalized Encoding of Description Spaces and its Application to Typed Feature Structures Gerald Penn Department of Computer Science University of Toronto 10 King s College Rd. Toronto M5S 3G4 Canada Abstract This paper presents a new formalization of a unification- or join-preserving encoding of partially ordered sets that more essentially captures what it means for an encoding to preserve joins generalizing the standard definition in AI research. It then shows that every statically typable ontology in the logic of typed feature structures can be encoded in a data structure of fixed size without the need for resizing or additional union-find operations. This is important for any grammar implementation or development system based on typed feature structures as it significantly reduces the overhead of memory management and reference-pointer-chasing during unification. 1 Motivation The logic of typed feature structures Carpenter 1992 has been widely used as a means of formalizing and developing natural language grammars that support computationally efficient parsing generation and SLD resolution notably grammars within the Head-driven Phrase Structure Grammar HPSG framework as evidenced by the recent successful development of the LinGO reference grammar for English LinGO 1999 . These grammars are formulated over a finite vocabulary of features and partially ordered types in respect of constraints called appropriateness conditions. Appropriateness specifies for each type all and only the features that take values in feature structures of that type along with nom acc case adj noun plus minus subst bool head MOD bool PRD bool CASE case Figure 1 A sample type system with appropriateness conditions. the types of values value restrictions those feature values must have. In Figure 1 1 for example all head-typed TFSs must have bool-typed values for .

• Báo cáo khoa học
• Generalized Encoding
• Description Spaces
• Typed Feature Structures
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• A Generalized Zero Preserving Method
• Compact Encoding
• Concept Lattices
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• 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