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




@InProceedings{Krieger:1995_4,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Formalisms as a Common Basis for Linguistic Specification},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 3rd International EAMT Workshop, April 26-28},
      PAGES = {101-119},
      EDITOR = {Steffens, Petra},
      SERIES = {Machine Translation and the Lexicon},
      ADDRESS = {Heidelberg, Germany},
      PUBLISHER = {Springer Verlag},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1994/RR-94-39.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-39.ps.Z},
      ABSTRACT = {Typed feature formalisms (TFF) play an increasingly important role in CL and NLP. Many of these systems are inspired by Pollard and Sag's work on Head-Driven Phrase Structure Grammar (HPSG), which has shown that a great deal of syntax and semantics can be neatly encoded within TFF. However, syntax and semantics are not the only areas in which TFF can be beneficially employed. In this paper, I will show that TFF can also be used as a means to model finite automata (FA) and to perform certain types of logical inferencing. In particular, I will (i) describe how FA can be defined and processed within TFF and (ii) propose a conservative extension to HPSG, which allows for a restricted form of semantic processing within TFF, so that the construction of syntax and semantics can be intertwined with the simplification of the logical form of an utterance. The approach which I propose provides a uniform, HPSG-oriented framework for different levels of linguistic processing, including allomorphy and morphotactics, syntax, semantics, and logical form simplification.},
      ANNOTE = {COLIURL : Krieger:1995:TFF.pdf Krieger:1995:TFF.ps}
}