Extending Unification Formalisms

About this list Date view Thread view Subject view Author view

Gregor Erbach (gregor@mail4.ai.univie.ac.at)
Thu, 3 Aug 1995 13:25:27 +0200 


Dear ALEP users and HPSG fans, (apologies to those 
who are both and receive this message twice)

the project "Reusable Grammatical Resources" (RGR)
has extended a typed feature formalism with sets
and linear precedence constraints, and some
notational devices. We extended both the ALEP
formalism and ProFIT formalism with these
constraints. 

The extended formalism is currently re-implemented
in the new Sicstus Prolog 3.1, and will be freely
available. 

A new paper describing the results of the project 
is now available as Postscript file from the 
project's WWW homepage: 

http://coli.uni-sb.de/info/projects/rgr.html

or by anonymous ftp:

ftp://coli.uni-sb.de/pub/claus/claus62.ps

The abstract of the paper follows below.

Regards,
    Gregor

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

       Extending Unification Formalisms 

       G. Erbach & M. van der Kraan & S. Manandhar & 
       H. Ruessink & C. Thiersch & W. Skut 

to appear in: Proceedings of the 2nd Language Engineering 
              Convention, London, 1995 

Abstract:

This paper describes some of the results of the 
project LRE-61-061: The Reusability of Grammatical
Resources. The aim of the project is to extend 
unification formalisms with notational devices and
constraint solvers in order to facilitate the 
development of reusable grammars. Work covers both the
theoretical description of the extensions as well as 
the practical implementation. The project took the
Advanced Linguistic Engineering Platform (ALEP) 
as its starting point. ALEP was designed to allow for
two levels of extension: additional syntactic 
expressions {"syntactic sugar"} and external specialised
constraint solvers. The syntactic additions to 
ALEP comprise LFG coherence and completeness and an
extended notation for phrase-structure rules. 
The project has developed solvers for set constraints and
set operations, linear precedence constraints and for 
implicational or guarded constraints.

About this list Date view Thread view Subject view Author view

This archive was generated by hypermail 2.0b3 on Fri Dec 18 1998 - 20:33:03 PST