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




@Article{Backofen_et_al:1995,
      AUTHOR = {Backofen, Rolf and Rogers, James and Shanker, Vijay K.},
      TITLE = {A First-Order Axiomatization of the Theory of Finite Trees},
      YEAR = {1995},
      JOURNAL = {Journal of Logic, Language and Information},
      VOLUME = {4},
      NUMBER = {1},
      PAGES = {5-39},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:FOA.pdf Backofen:1995:FOA.ps Backofen:1995:FOA.dvi}
}

@InProceedings{Kasper_et_al:1995,
      AUTHOR = {Kasper, Robert and Kiefer, Bernd and Netter, Klaus and Shanker, Vijay K.},
      TITLE = {Compilation of HPSG to TAG},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL'95), June 26-30},
      PAGES = {92-99},
      ADDRESS = {Cambridge, Massachusetts, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.ps.Z},
      ABSTRACT = {We present an implemented compilation algorithm that translates HPSG into lexicalized feature-based TAG, relating concepts of the two theories. While HPSG has a more elaborated principle-based theory of possible phrase structures, TAG provides the means to represent lexicalized structures more explicitly. Our objectives are met by giving clear definitions that determine the projection of structures from the lexicon, and identify maximal projections, auxiliary trees and foot nodes.},
      ANNOTE = {COLIURL : Kasper:1995:CHTa.pdf Kasper:1995:CHTa.ps}
}

@InProceedings{Netter_et_al:1994,
      AUTHOR = {Netter, Klaus and Kasper, Robert and Kiefer, Bernd and Shanker, Vijay K.},
      TITLE = {HPSG and TAG},
      YEAR = {1994},
      BOOKTITLE = {Proceedings of the 3eme Colloque International sur les Grammaires d'Arbres Adjoints, September},
      NUMBER = {RT-94-01},
      PAGES = {77-82},
      SERIES = {(TAG+3) Rapport TALANA},
      ADDRESS = {Paris, France},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.ps.Z},
      ABSTRACT = {We present a compilation algorithm that translates Head Driven Phrase Structure Grammars into lexicalized feature based Tree Adjoining Grammars. Through this exercise we attempt to gain further insights into the nature of the two theories and to identify correlating concepts. While HPSG has a more elaborated lexicalized and principle-based theory of functor argument structures, TAG provides the means to represent lexical-based structural information more explicitly and to factor out recursion. Our objectives are met by giving clear and simple definitions for projecting structure from the lexicon, for determining maximal projections, and for identifying potential auxiliary trees and foot nodes.}
}