DFKI-LT - Extending Unification Formalisms
Extending Unification Formalisms
2 Proceedings of the 2nd Language Engineering Convention, London, United Kingdom, o.A., 1995
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.
Files: BibTeX, Erbach:1995:EUFa.pdf