%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:39 +0100 GMT
%    
% Selection : Author: Tore_Burheim
%




@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}
}

@TechReport{Burheim:1995_1,
      AUTHOR = {Burheim, Tore},
      TITLE = {Indexed Languages and Unification Grammars},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {63},
      PAGES = {16},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Unversität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus63.ps},
      ABSTRACT = {Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.},
      ANNOTE = {COLIURL : Burheim:1995:ILU.pdf Burheim:1995:ILU.ps}
}