Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISLOG stands for programming in logic with discontinuities and permits to express in a simple, concise and declarative way relations or constraints between non-contiguous elements in a structure. DISLOG is also weel adapted to model other types of linguistic phenomena like Quantifier Raising involving long-distance relations or constraints. . | Programming in Logic with Constraints for Natural Language Processing Patrick Saint-Dizier LSI Université Paul Sabatier 118 route de Narbonne 31062 TOULOUSE Cedex France Abstract In this paper we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose we have designed a language called DISLOG. DISLOG stands for programming in logic with discontinuities and permits to express in a simple concise and declarative way relations or constraints between non-contiguous elements in a sttucture. DISLOG is also weel adapted to model other types of linguistic phenomena like Quantifier Raising involving long-distance relations or constraints. 1. Introduction Many areas of natural language syntax and semantics are a fruitful source of inspữation for computer languages and systems designers. The complexity of natural language and the high level of abstraction of most linguistic and semantic theories have motivated the emergence of highly abstract and transparent programming languages. One of the most sữiking examples is undoubtedly Prolog initially designed for natural language parsing via Metamorphosis Grammars Colmerauer 1978 . For a few years the Logic Programming paradigm has been augmented with a number of technical and formal devices designed to extend its expressive power. New logic programming languages have emerged several of them motivated by natural language processing problems. Among them let US mention CIL Mukai 1985 designed to express in a direct way concepts of Situation Semantics MOLOG Farinas et al. 1985 an extension to Prolog designed to specify in a very simple and declarative way the semantics of modal operators and X-Prolog Nadathur and Miller 1988 designed to deal with X-expressions and X-reduction. Recently the Logic Programming paradigm has been augmented with the concept of consưained logic programming CLP . The basic research done within this area amounts to specifying tools for a more refined .
