@TechReport{Burheim:1995,
AUTHOR = {Burheim, Tore},
TITLE = {A Grammar Formalism and Cross-Serial Dependencies},
YEAR = {1995},
MONTH = {March},
NUMBER = {53},
ADDRESS = {Saarbrücken},
TYPE = {CLAUS-Report},
INSTITUTION = {Universität des Saarlandes},
URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus53.ps},
ABSTRACT = {First we define a unification grammar formalism called the Tree HomomorphicFeature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism defines a full abstract family of languages, and that it is capable of describing crossserial dependencies of the type found in Swiss German.},
ANNOTE = {COLIURL : Burheim:1995:GFC.pdf Burheim:1995:GFC.ps}
}
|
