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




@TechReport{Avgustinova_Oliva:1996_1,
      AUTHOR = {Avgustinova, Tania and Oliva, Karel},
      TITLE = {Unbounded Dependencies in HPSG Without Traces or Lexical Rules},
      YEAR = {1996},
      MONTH = {January},
      NUMBER = {70},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {In the course of work on large-coverage HPSG grammars destinated for application in commercial grammar checkers for Bulgarian and Czech, two languages typologically different from English with respect to the word order freedom, we have developed and practically tested an alternative, efficient-implementation oriented treatment of unbounded dependencies dispensing both with gaps and with lexical rules. In this paper we shall explain the theoretical basis of the approach as well as try to prove that it is not only practically, but also theoretically superior to the current standard treatment.}
}