TAILIEUCHUNG - Báo cáo khoa học: "DATR Theories and DATR Models"

Evans and Gazdar (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b) introduced DATR as a simple, non-monotonic language for representing natural language lexicons. Although a number of implementations of DATR exist, the full language has until now lacked an explicit, declarative semantics. This paper rectifies the situation by providing a mathematical semantics for DATR. We present a view of DATR as a language for defining certain kinds of partial functions by cases. The formal model provides a transparent treatment of DATR's notion of global context | DATR Theories and DATR Models Bin Keller School of Cognitive and Computing Sciences The University of Sussex Brighton UK email billk@ Abstract Evans and Gazdar Evans and Gazdar 1989a Evans and Gazdar 1989b introduced DATR as a simple non-monotonic language for representing natural language lexicons. Although a number of implementations of DATR exist the full language has until now lacked an explicit declarative semantics. This paper rectifies the situation by providing a mathematical semantics for DATR. We present a view of DATR as a language for defining certain kinds of partial functions by cases. The formal model provides a transparent treatment of DATR s notion of global context. It is shown that DATR s default mechanism can be accounted for by interpreting value descriptors as families of values indexed by paths. 1 Introduction DATR was introduced by Evans and Gazdar 1989a 1989b as a simple declarative language for representing lexical knowledge in terms of path value equations. The language lacks many of the constructs found in general purpose knowledge representation formalisms yet it has sufficient expressive power to capture concisely the structure of lexical information at a variety of levels of linguistic description. At the present time DATR is probably the most widely-used formalism for representing natural language lexicons in the natural language processing NLP community. There are around a dozen different implementations of the language and large DATR lexicons have been constructed for use in a variety of applications Cahill and Evans 1990 Andry et al. 1992 Cahill 1994 . DATR has been applied to problems in inflectional and derivational morphology Gazdar 1992 Kilbury 1992 Corbett and Fraser 1993 lexical semantics Kilgariff 1993 morphonology Cahill 1993 prosody Gibbon and Bleiching 1991 and speech Andry et al. 1992 . In more recent work the language has been used to provide a concise encoding of Lexicalised Tree Adjoining Grammar Evans

• Báo cáo khoa học
• DATR Theories
• DATR Models
• Bill Keller
• 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