ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Sorted feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all sorted feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of sorted feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with sorted feature terms to Prolog programs usable for practical NLP systems. 1

Przegl , ad system'ow do implementacji gramatyk HPSG Niniejszy raport stanowi przegl , ad najbardziej popularnych system'ow umozliwiaj , acych implementacj , e gramatyk formalnych j , ezyka naturalnego. Selekcji system'ow dokonano ze wzgl , edu na ich przydatno's'c do implementacji gramatyk HPSG. Dla kazdego z uwzgl , ednionych system'ow (TFS, CUF, ALE, ALEP, PAGE, ProFIT, CL-ONE i ConTroll) opisano przyj , ete na jego potrzeby za/lozenia dotycz , ace hierarchii typ'ow, sposobu zapisu struktur atrybut'ow, mozliwo'sci implementacji regu/l gramatyk typu HPSG (regu/ly LP/IP, regu/ly leksykalne). Om'owione zosta/ly tez cechy uzytkowe poszczeg'olnych system'ow: dost , epno's'c, jako's'c dokumentacji, wymagania sprz , etowe i programowe, efektywno's'c oraz 'srodowisko programistyczne. W cz , e'sci ko'ncowej raportu zawarto szczeg'o/lowe por'ownanie opisywanych system'ow. A Survey of Systems for Implementing HPSG Gramamrs In this report, we present an overview of some chosen grammar devel...

om English and Japanese. Teich's distinctive contributions are the development of a large SFG-based grammar for German using the KOMET-Penman system, and a detailed analysis of the problems encountered due to the absence of any notion of head-daughter dependency within SFG theory. Comparing SFG and HPSG, Teich proposes a modification of SFG theory to allow the inclusion of dependency relations. Chapter 1, "Introduction", presents the motivation for the book. The terminology used within SFG theory sometimes appears to be unnecessarily daunting. For example, we learn on p. 3 that the background is "linguistic theory as metasemiosis." Chapter 2, "Theory and linguistic representation: Systemic functional linguistics," is intended as a short introduction to SFG theory. This is very well written for SFG specialists, but it covers an enormous amount of ground at great speed (even summarizing the theoretical differences between Hudson, Huddleston, Henrici, Halliday, Fawcett, and Berry) and i

this paper is, therefore, to re-represent systemic grammar resources in a standard typed feature logic in order (1) to clarify theoretically the relation between systemic grammar and state-of-the-art feature logics, and (2) to serve as point of departure for bidirectional processing of systemic grammar. Four such representations in the feature logic formalisms ale, tfs, cuf and tdl

The purpose of this paper is to outline the requirements that the field of Natural Language Processing (NLP) has for a declarative successor to Prolog. Logic programming approaches play a major role in NLP, and likewise considerations of NLP have had a strong influence on logic programming ([Colmerauer, 1978], [Pereira and Warren, 1980], [Smolka, 1992]). We will review the state of the art in NL grammar formalisms and processing algorithms in the logic programming paradigm, from the perspective of research in grammatical theory (Computational Linguistics) and from the perspective of applied NLP (Language Engineering). The relationship to Prolog and to current developments in (C)LP will be discussed. We will outline the requirements for a logic programming language that will both support the current practice in NLP and provide a platform which can accommodate future research results.

This report is an extension of (Gregory 2001) and presents an overview of the implementation of the HPSG grammar currently used in SHARDS —a Semantically-based HPSG Approach to the Resolution of Dialogue Fragments (Ginzburg, Gregory, and Lappin 2001). The grammar is based on the theoretical framework presented in (Ginzburg and Sag 2001) and it is encoded in ProFIT (Erbach 1995). 1

This paper considers three assumptions conventionally made about signatures in typed feature logic that are in potential disagreement with current practice among grammar developers and linguists working within feature-based frameworks such as HPSG: meet-semi-latticehood, unique feature introduction, and the absence of subtype covering. It also

this paper is to survey the requirements that natural language processing (NLP) has on a programming language, evaluate to what extent they are satised by various programming logic programming languages, and in particular by the Oz language. It turns out that Oz appers to be a promising candidate for NLP implementations. ########| Natural Language Processing, Grammar Formalisms, Oz 1. Introduction For a long time, NLP has been in a love-hate relationship with logic programming in general, and with Prolog in particular. Let's consider the positive sides rst: # Prolog is a declarative language # Prolog provides useful data structures such as trees (terms), lists, and logical variables # Unication comes for free # Search comes for free It's nice to remember the enjoyment of writing one's rst DCG and having it parse and generate sentences after just some minutes of development time. And indeed many useful natural l

Abstract not found