%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:41:12 +0100 GMT
%    
% Selection : Year = 1995
%




@InProceedings{Asker_Gambäck:1995,
      AUTHOR = {Asker, Lars and Gambäck, Björn},
      TITLE = {Acquiring a Lexicon by Actively Querying the User},
      YEAR = {1995},
      BOOKTITLE = {AAAI Fall Symposium on Active Learning, November 10-12},
      ADDRESS = {Cambridge, Massachussetts},
      URL = {www.sics.se/~gam/aaaifall95.ps},
      ANNOTE = {COLIURL : Asker:1995:ALA.pdf}
}

@Article{Avgustinova_Oliva:1995,
      AUTHOR = {Avgustinova, Tania and Oliva, Karel},
      TITLE = {Wackernagel Position and Related Phenomena in Czech},
      YEAR = {1995},
      JOURNAL = {Wiener Slavistisches Jahrbuch},
      VOLUME = {41},
      PAGES = {21-42}
}

@TechReport{Avgustinova_Oliva:1995_1,
      AUTHOR = {Avgustinova, Tania and Oliva, Karel},
      TITLE = {The Position of Sentential Clitics in the Czech Clause},
      YEAR = {1995},
      MONTH = {December},
      NUMBER = {68},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {Our main goal is to propose a unified analysis of the second position and Wackernagel phenomena, which would adequately accommodate also certain non-trivial data that seem to be problematic for the currently available approaches: 1. Correct sentences with multiple syntactic constituents preceding the sentential clitics in Czech, and respectively, multiple syntactic constituency in the German Vorfeld: a. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials describing together a spatial or temporal interval; b. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials of the same type, which can be viewed as a repetition of the respective modification; c. Czech clitics (respectively, the tensed verb in German main clauses) preceded by a combination of a temporal and a local adverbial; d. Czech clitics (respectively, the tensed verb in German main clauses) preceded by more than one contrasted syntactic constituents 2. Sentences with a single constituent preceding the sentential clitics (respectively, single constituent in the Vorfeld) but judged to be highly unacceptable . We reconsider the Prague School treatment of the communicative structure of the sentence, and assume that, for each particular utterance, it can be determined which of the contained elements are informationally essential (significant) - i.e. informationally indispensable from a communicative perspective - and which of them are informationally unessential (insignificant) - i.e. without actual communicative contribution - and occur in the utterance for other, e.g., structural, pleonastic etc., reasons only. On such a basis we (re)introduce the notion of communicative importance. We further assume that not all elements of an utterance can be assigned a degree of communicative dynamism - i.e. that there are items for which the feature communicative importance is inappropriate. Another assumption is that in an utterance there might exist two or more syntactically distinguishable constituents which are of equal communicative importance. After these modifications, we introduce a structuring of an utterance into communicative units which we tentatively call communicative segments. A substantial communicative segment is defined as a contiguous sequence of adjacent syntactic units (i.e. words or phrases) of equal communicative importance, while an auxiliary communicative segment is a contiguous sequence of informationally insignificant items for which communicative importance is inappropriate as a feature. From such a perspective the Wackernagel's clitic cluster in Czech is regarded as an instance of an auxiliary communicative segment. We further define the second / Wackernagel position as the position delimiting the first (leftmost) substantial communicative segment in an utterance, and thus propose an alternative treatment also of the German Vorfeld. Inasmuch as there are language-specific constraints on what can form a substantial communicative segment, our analysis allows for a natural explanation also of, e.g., the constituent-second / word-second position of Serbo-Croatian clitics.}
}

@Article{Backofen:1995,
      AUTHOR = {Backofen, Rolf},
      TITLE = {A Complete Axiomatization of a Theory with Feature and Arity Constraints},
      YEAR = {1995},
      JOURNAL = {The Journal of Logic Programming},
      VOLUME = {24},
      PAGES = {37-72},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:CAT.pdf Backofen:1995:CAT.ps Backofen:1995:CAT.dvi}
}

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

@Article{Backofen_Smolka:1995,
      AUTHOR = {Backofen, Rolf and Smolka, Gert},
      TITLE = {A Complete and Recursive Feature Theory},
      YEAR = {1995},
      JOURNAL = {Theoretical Computer Science},
      VOLUME = {146},
      NUMBER = {1-2},
      PAGES = {243-268},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:CRF.pdf Backofen:1995:CRF.ps Backofen:1995:CRF.dvi}
}

@InProceedings{Barry:1995,
      AUTHOR = {Barry, William J.},
      TITLE = {Phonetics and Phonology of Speaking Styles},
      YEAR = {1995},
      BOOKTITLE = {13th International Congress of Phonetic Sciences, August 13-19},
      VOLUME = {2},
      PAGES = {4-10},
      EDITOR = {Elenius, K. and Branderud, P.},
      ADDRESS = {Stockholm, Sweden}
}

@Article{Barry:1995_1,
      AUTHOR = {Barry, William J.},
      TITLE = {Schwa vs. Schwa+/r/ in German},
      YEAR = {1995},
      JOURNAL = {Phonetica},
      VOLUME = {52},
      NUMBER = {3},
      PAGES = {228-235}
}

@Article{Barry:1995_2,
      AUTHOR = {Barry, William J.},
      TITLE = {Phonetik im Kopf und im Computer. Gedanken zur Theorie der Phonetik},
      YEAR = {1995},
      JOURNAL = {PHONUS},
      VOLUME = {1},
      PAGES = {1-18},
      URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Barry_PHONUS1.ps.gz},
      ABSTRACT = {The following text is a version of my Inaugural Lecture, slightly modified for the purpose of distribution in printed form, which was held on 6 June 1994 in the Faculty of Arts, University of the Saarland, Saarbrücken.},
      ANNOTE = {COLIURL : Barry:1995:PIK.pdf}
}

@Article{Barry_Pützer:1995,
      AUTHOR = {Barry, William J. and Pützer, Manfred},
      TITLE = {Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialektgebieten im Saarland und in Rheinland-Pfalz},
      YEAR = {1995},
      JOURNAL = {PHONUS},
      VOLUME = {1},
      PAGES = {53-64},
      URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus1/BarryPuetzer_PHONUS1.ps.gz},
      ABSTRACT = {Das häufige Auftreten von wortinitialem /p, t, k/ in phonetisch/phonologischen Darstellungen des Moselfränkischen und gegensätzlich dazu /b, d, g/ in ebensolchen über rheinfränkische Dialekte erhebt die Frage nach der phonetischen Basis der Fortis-Lenis-Opposition, die trotz der Alternation in beiden Dialektgebieten vorhanden ist. Eine Untersuchung der Produktion dieser Opposition bei den Plosiven und ein Perzeptionstest mit manipulierten Stimuli aus dem Produktionskorpus wurden mit Dialektsprechern und -hörern aus zwei moselfränkischen und zwei rheinfränkischen Orten durchgeführt. Die Ergebnisse zeigen, daß trotz gruppenmäßig- und individuell systematischer Produktionsunterschiede für beide Gruppen die Plosivlösung das stärkste Signal für die perzeptorische Unterscheidung ist. Eine unterschiedliche Tendenz bei den Hörergruppen bezüglich der Gewichtung unterschiedlicher Lösungsintensitäten bei kurzer Lösungsdauer entspricht der in der Dialektliteratur gefundenen Transkriptionsvariation.},
      ANNOTE = {COLIURL : Barry:1995:PBF.pdf}
}

@InProceedings{Berglund_Gambäck:1995,
      AUTHOR = {Berglund, Charlotta and Gambäck, Björn},
      TITLE = {On Testing Domain Adaptability},
      YEAR = {1995},
      BOOKTITLE = {10th Nordic Conference of Computational Linguistics, May 30-31},
      PAGES = {90-94},
      EDITOR = {Koskenniemi, Kimmo},
      ADDRESS = {Helsinki, Finland},
      PUBLISHER = {University of Helsinki},
      URL = {www.sics.se/humle/papers/nodalida95_eval.ps},
      ANNOTE = {COLIURL : Berglund:1995:TDA.pdf Berglund:1995:TDA.ps}
}

@TechReport{Blackburn_de Rijke:1995,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Why Combine Logics?},
      YEAR = {1995},
      MONTH = {April},
      NUMBER = {57},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus57.ps},
      ABSTRACT = {Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems.},
      ANNOTE = {COLIURL : Blackburn:1995:WCL.pdf Blackburn:1995:WCL.ps}
}

@TechReport{Blackburn_et_al:1995,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide},
      TITLE = {Relational Methods in Logic, Language and Information},
      YEAR = {1995},
      MONTH = {September},
      NUMBER = {65},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus65.ps},
      ABSTRACT = {This paper discusses the use of relational methods in the interdisciplinary field of Logic, Language and Information. We first sketch the developments that lead to the current focus on dynamics in the area. After that we give examples of logics of transitions that naturally arise in this setting, and we identify more general themes such as bisimulations, relativisations and dynamic modes of inference. We conclude with a discussion of newly emerging themes, and the limitations of the relational perspective.},
      ANNOTE = {COLIURL : Blackburn:1995:RML.pdf Blackburn:1995:RML.ps}
}

@InProceedings{Blackburn_Gardent:1995,
      AUTHOR = {Blackburn, Patrick and Gardent, Claire},
      TITLE = {A Specification Language for Lexical Functional Grammars},
      YEAR = {1995},
      BOOKTITLE = {7th Conference of the European Chapter of the Association for Computational Linguistics (EACL '91)},
      PAGES = {39-44},
      ADDRESS = {Dublin}
}

@TechReport{Blackburn_Gardent:1995_1,
      AUTHOR = {Blackburn, Patrick and Gardent, Claire},
      TITLE = {A Specification Language for Lexical Functional Grammars},
      YEAR = {1995},
      MONTH = {February},
      NUMBER = {51},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.dvi},
      ABSTRACT = {This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use L to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed.},
      ANNOTE = {COLIURL : Blackburn:1995:SLLb.pdf Blackburn:1995:SLLb.ps Blackburn:1995:SLLb.dvi}
}

@TechReport{Blackburn_et_al:1995_1,
      AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten},
      TITLE = {A Proof System for Finite Trees},
      YEAR = {1995},
      MONTH = {October},
      NUMBER = {67},
      PAGES = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus67.ps},
      ABSTRACT = {In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol and Blackburn and Meyer-Viol. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.},
      ANNOTE = {COLIURL : Blackburn:1995:PSFb.pdf}
}

@InProceedings{Blackburn_et_al:1995_2,
      AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten},
      TITLE = {A Proof System for Finite Trees},
      YEAR = {1995},
      BOOKTITLE = {Computer Science Logic. 9th International Workshop (CSL '95)},
      NUMBER = {1092},
      PAGES = {86-105},
      EDITOR = {Kleine Büning, H.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer}
}

@TechReport{Blackburn_Seligman:1995,
      AUTHOR = {Blackburn, Patrick and Seligman, Jerry},
      TITLE = {Hybrid Languages},
      YEAR = {1995},
      MONTH = {October},
      NUMBER = {66},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus66.ps},
      ABSTRACT = {Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability problems.},
      ANNOTE = {COLIURL : Blackburn:1995:HLA.pdf Blackburn:1995:HLA.ps}
}

@Article{Blackburn_Seligman:1995_1,
      AUTHOR = {Blackburn, Patrick and Seligman, Jerry},
      TITLE = {Hybrid Languages},
      YEAR = {1995},
      JOURNAL = {Journal of Logic, Language and Information},
      VOLUME = {4},
      PAGES = {251-272}
}

@InProceedings{Bos_et_al:1995,
      AUTHOR = {Bos, Johan and Buitelaar, Paul and Mineur, Anne-Marie},
      TITLE = {Bridging as Coercive Accomodation},
      YEAR = {1995},
      BOOKTITLE = {Computational Logic for Natural Language Processing (CLNLP '95) - Workshop Proceedings, April 3-5},
      EDITOR = {Manandhar, Suresh},
      ADDRESS = {South Queensferry, Scotland},
      URL = {http://www.elsnet.org/publications/clnlp95/Bos-Mineur.ps.gz},
      NOTE = {A shorter version also appeared in the Lecture Notes of a workshop on The Computational Lexicon, at the 6th ESSLLI, Barcelona 1995},
      ANNOTE = {COLIURL : Bos:1995:BCAa.pdf Bos:1995:BCAa.ps}
}

@InProceedings{Bos_et_al:1995_1,
      AUTHOR = {Bos, Johan and Buitelaar, Paul and Mineur, Anne-Marie},
      TITLE = {Bridging as Coercive Accomodation},
      YEAR = {1995},
      BOOKTITLE = {6th European Summer School in Logic, Language, and Information (ESSLLI'95). Workshop on The Computational Lexicon, August 13-25},
      ADDRESS = {Barcelona, Spain}
}

@TechReport{Bos_et_al:1995_2,
      AUTHOR = {Bos, Johan and Mineur, Anne-Marie and Buitelaar, Paul},
      TITLE = {Bridging as Coercive Accomodation},
      YEAR = {1995},
      MONTH = {March},
      NUMBER = {52},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus52.ps},
      ABSTRACT = {This paper combines insights from Pustejovsky's GL theory with Van der Sandt's anaphora resolution algorithm. The phenomenon of bridging is accounted for in terms of linking anaphoric expressions to information that can be inferred from the lexical semantic knowledge that is stored in lexical entries. In doing so, we can distinguish between the normal linking cases as in (1), the special cases of coercive accommodation as in (2) and the bottom cases of accommodation as in (3). (1) When I call a barkeeper, the barkeeper never comes. (2) When I go to a bar, the barkeeper always throws me out. (3) When I came in, the barkeeper said hello.},
      ANNOTE = {COLIURL : Bos:1995:BCAc.pdf Bos:1995:BCAc.ps}
}

@InProceedings{Brants:1995,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Tagset Reduction Without Information Loss},
      YEAR = {1995},
      BOOKTITLE = {33rd Annual Meeting of the Association for Computational Linguistics (ACLANNUAL'95)},
      ADDRESS = {Cambridge, Massachussetts, USA},
      ANNOTE = {COLIURL : Brants:1995:TRI.pdf}
}

@InProceedings{Brants:1995_1,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Estimating HMM Topologies},
      YEAR = {1995},
      BOOKTITLE = {Tbilisi Symposium on Language, Logic, and Computation, October 19-22},
      ADDRESS = {Tbilisi, Georgia}
}

@TechReport{Brants:1995_2,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Some Experiments with the CRATER Corpus},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Universität des Saarlandes}
}

@InProceedings{Brants_Samuelsson:1995,
      AUTHOR = {Brants, Thorsten and Samuelsson, Christer},
      TITLE = {Tagging the Teleman Corpus},
      YEAR = {1995},
      BOOKTITLE = {10th Nordic Conference of Computational Linguistics, May 30-31},
      ADDRESS = {Helsinki, Finland},
      ANNOTE = {COLIURL : Brants:1995:TTCa.pdf}
}

@TechReport{Brants_Samuelsson:1995_1,
      AUTHOR = {Brants, Thorsten and Samuelsson, Christer},
      TITLE = {Tagging the Teleman Corpus},
      YEAR = {1995},
      MONTH = {April},
      NUMBER = {54},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus54.ps},
      ABSTRACT = {Experiments were carried out comparing the Swedish Teleman and the English Susanne corpora using an HMM-based and a novel reductionistic statistical part-of-speech tagger. They indicate that tagging the Teleman corpus is the more difficult task, and that the performance of the two different taggers is comparable.},
      ANNOTE = {COLIURL : Brants:1995:TTCb.pdf Brants:1995:TTCb.ps}
}

@InProceedings{Brawer:1995,
      AUTHOR = {Brawer, Sascha},
      TITLE = {Treating German with a Provable Context-Free Grammar. Coping with Subcategorization, Unbound Dependencies and Partial Free-Word Order},
      YEAR = {1995},
      BOOKTITLE = {5. Tagung der Computerlingustik Studenten (TaCoS), 24.-28. Mai},
      PAGES = {5-16},
      EDITOR = {Brawer, Sascha},
      ADDRESS = {Saarbrücken, Germany}
}

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

@InProceedings{Busemann:1995,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Towards Classification of Generation Subtasks},
      YEAR = {1995},
      BOOKTITLE = {Principles of Natural Language Generation. Papers from a Dagstuhl-Seminar},
      NUMBER = {SI-12},
      PAGES = {25-32},
      EDITOR = {Hoeppner, Wolfgang and Horacek, Helmut},
      SERIES = {Dagstuhl-Seminar-Report},
      ADDRESS = {Duisburg, Germany},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Busemann_1994_TSOGS.pdf},
      ANNOTE = {COLIURL : Busemann:1995:TCG.pdf}
}

@TechReport{Busemann_Merget:1995,
      AUTHOR = {Busemann, Stephan and Merget, Iris},
      TITLE = {Eine Untersuchung kommerzieller Terminverwaltungs-Software im Hinblick auf die Kopplung mit natürlichsprachlichen Systemen},
      YEAR = {1995},
      NUMBER = {D-95-11},
      ADDRESS = {Saarbrücken},
      TYPE = {DFKI Document},
      INSTITUTION = {DFKI},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1995/D-95-11.ps.gz},
      ANNOTE = {COLIURL : Busemann:1995:UKT.pdf Busemann:1995:UKT.ps}
}

@InCollection{Busemann_Novak:1995,
      AUTHOR = {Busemann, Stephan and Novak, Hans-Joachim},
      TITLE = {Generierung natürlicher Sprache},
      YEAR = {1995},
      BOOKTITLE = {Einführung in die Künstliche Intelligenz},
      PAGES = {492-540},
      EDITOR = {Görz, Günther},
      ADDRESS = {Bonn},
      PUBLISHER = {Addison-Wesley},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_GNS.pdf},
      NOTE = {2. Auflage},
      ANNOTE = {COLIURL : Busemann:1995:GNS.pdf}
}

@TechReport{Butz:1995,
      AUTHOR = {Butz, Andreas},
      TITLE = {BETTY: Ein System zur Planung und Generierung informativer Animationssequenzen},
      YEAR = {1995},
      NUMBER = {D-95-02},
      ADDRESS = {Saarbrücken},
      TYPE = {DFKI Document},
      INSTITUTION = {DFKI}
}

@TechReport{Crouch_et_al:1995,
      AUTHOR = {Crouch, Richard and Gaizauskas, Robert and Netter, Klaus},
      TITLE = {Report of the Study Group on Assessment and Evaluation},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      TYPE = {Interim Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.ps.gz},
      ANNOTE = {COLIURL : Crouch:1995:RSG.pdf Crouch:1995:RSG.ps Crouch:1995:RSG.dvi}
}

@InProceedings{Declerck_et_al:1995,
      AUTHOR = {Declerck, Thierry and Rieder, Sibylle and Schmidt, Paul and Theofilidis, Axel},
      TITLE = {Integration grammatischer Komponenten und Organisation des Lexikons in ALEP},
      YEAR = {1995},
      BOOKTITLE = {Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 95)},
      ADDRESS = {Düsseldorf, Germany}
}

@TechReport{Diagne_et_al:1995,
      AUTHOR = {Diagne, Abdel Kader and Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Distributed Parsing with HPSG Grammars},
      YEAR = {1995},
      NUMBER = {RR-95-19},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI}
}

@InProceedings{Erbach:1995,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Why NLP needs Oz},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 1st Workshop on Oz Programming (WOz'95), November 29 - December 1},
      PAGES = {51-54},
      ADDRESS = {Martigny, Switzerland},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/woz/woz-erbach.pdf},
      ABSTRACT = {The purpose of this paper is to survey the requirements that natural language processing (NLP) has on a programming language, evaluate to what extent they are satisfied by various programming logic programming languages, and in particular by the Oz language. It turns out that Oz appers to be a promising candidate for NLP implementations.},
      ANNOTE = {COLIURL : Erbach:1995:WNN.pdf}
}

@InProceedings{Erbach:1995_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {ProFit - Prolog with Features, Inheritance, and Templates},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL'95), March 27-31},
      PAGES = {180-187},
      ADDRESS = {University College Dublin, Ireland},
      ABSTRACT = {ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Typed feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all typed feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of typed feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with typed feature terms to Prolog programs usable for applications.}
}

@InProceedings{Erbach_Manandhar:1995,
      AUTHOR = {Erbach, Gregor and Manandhar, Suresh},
      TITLE = {Visions for the Future of Logic-Based Natural Language Processing},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the ILPS'95 Workshop Visions for the Future of Logic Programming - Laying the Foundations for a Modern Successor to Prolog, December 8},
      ADDRESS = {Portland, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ilps95.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ilps95.entry},
      ANNOTE = {COLIURL : Erbach:1995:VFL.pdf Erbach:1995:VFL.ps}
}

@TechReport{Erbach_et_al:1995,
      AUTHOR = {Erbach, Gregor and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {Linear Precedence Constraints in Lean Formalisms (I und II)},
      YEAR = {1995},
      NUMBER = {55},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf},
      ABSTRACT = {1. In this report a method for encoding LP constraints is presented that lends itself for a an easy integration into ALEP grammars since it does not require any changes to the formalism and to the implementation of the current ALEP development platform 2. In this report, we demonstrate the practical application of the methods outlined in Part I by the implementation of a grammar that covers the ordering of adjuncts and complements in the German Mittelfeld},
      ANNOTE = {COLIURL : Erbach:1995:LPC1.pdf Erbach:1995:LPC2.pdf Erbach:1995:LPC.zip}
}

@Book{Gregor_et_al:1995,
      TITLE = {The Reusability of Grammatical Resources. Deliverable D},
      YEAR = {1995},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@InProceedings{Erbach_et_al:1995_1,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Ruessink, Herbert and Thiersch, Craig and Skut, Wojciech},
      TITLE = {Extending Unification Formalisms},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 2nd Language Engineering Convention, October 16-18},
      ADDRESS = {London, UK},
      ABSTRACT = {This paper describes some of the results of the project LRE-61-061: The Reusability of Grammatical Resources. The aim of the project is to extend unification formalisms with notational devices and constraint solvers in order to facilitate the development of reusable grammars. Work covers both the theoretical description of the extensions as well as the practical implementation. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP was designed to allow for two levels of extension: additional syntactic expressions syntactic sugar and external specialised constraint solvers. The syntactic additions to ALEP comprise LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints and set operations, linear precedence constraints and for implicational or guarded constraints.},
      ANNOTE = {COLIURL : Erbach:1995:EUFa.pdf}
}

@TechReport{Erbach_et_al:1995_2,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Ruessink, Herbert and Thiersch, Craig and Skut, Wojciech},
      TITLE = {Extending Unification Formalisms},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {62},
      PAGES = {8},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/claus/claus62.ps},
      ABSTRACT = {This paper describes some of the results of the project LRE-61-061: The Reusability of Grammatical Resources. The aim of the project is to extend unification formalisms with notational devices and constraint solvers in order to facilitate the development of reusable grammars. Work covers both the theoretical description of the extensions as well as the practical implementation. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP was designed to allow for two levels of extension: additional syntactic expressions syntactic sugar and external specialised constraint solvers. The syntactic additions to ALEP comprise LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints and set operations, linear precedence constraints and for implicational or guarded constraints.},
      ANNOTE = {COLIURL : Erbach:1995:EUFb.pdf Erbach:1995:EUFb.ps}
}

@InProceedings{Gambäck:1995,
      AUTHOR = {Gambäck, Björn},
      TITLE = {Swedish Language Processing in the Spoken Language Translator},
      YEAR = {1995},
      BOOKTITLE = {10th Nordic Conference of Computational Linguistics, May 30-31},
      PAGES = {37-49},
      EDITOR = {Koskenniemi, Kimmo},
      ADDRESS = {Helsinki, Finland},
      PUBLISHER = {Department of General Linguistics, University of Helsinki},
      URL = {www.sics.se/humle/papers/nodalida95_slt.ps},
      ANNOTE = {COLIURL : Gamback:1995:SLP.pdf Gamback:1995:SLP.ps}
}

@InProceedings{Gambäck_et_al:1995,
      AUTHOR = {Gambäck, Björn and Eineborg, Martin and Eriksson, Michael and Ekholm, Barbro and Lyberg, Bertil and Svensson, Tomas},
      TITLE = {A Language Interface to a Polyphone-Based Speech Synthesizer},
      YEAR = {1995},
      BOOKTITLE = {4th European Conference on Speech Communication and Technology, September},
      VOLUME = {2},
      PAGES = {1219-1222},
      ADDRESS = {Madrid, Spain},
      URL = {http://www.sics.se/~gamback/publications/eurospeech95.ps},
      ANNOTE = {COLIURL : Gamback:1995:LIP.pdf Gamback:1995:LIP.ps}
}

@TechReport{Gardent:1995,
      AUTHOR = {Gardent, Claire},
      TITLE = {Generating with Discourse Grammar},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {58},
      PAGES = {21},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus58.ps},
      ABSTRACT = {In this paper, we show how typed unification based formalisms extended with arbitrary relations can be used to generate discourse. We start by presenting the specific framework being used (discourse grammar), and we argue that it provides a natural setting for a computational analysis of intersentential phenomena such as ellipsis, anaphora and focus. We then show that it is possible for a discourse grammar to be neither monotonic nor declarative and further, that a discourse grammar is not guaranteed to terminate even when the set of solutions to be found is finite. Finally, we argue that despite these non properties, a generator can be developed which both preserves the intended meaning of the grammar and terminates.},
      ANNOTE = {COLIURL : Gardent:1995:GDG.pdf Gardent:1995:GDG.ps}
}

@TechReport{Gardent_Dorrepaal:1995,
      AUTHOR = {Gardent, Claire and Dorrepaal, Joke},
      TITLE = {Reversible Discourse Processing},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {59},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.dvi},
      ABSTRACT = {In this paper we describe a reversible framework for discourse processing, a framework in which contextual constraints can be specified independently of the processing algorithm. We take as a starting point Scha and Polanyi's discourse grammar ([Scha/Polanyi 1988]) which is in essence a unification based grammar extended with arbitrary relations. Although such a framework can be shown to have many non properties (e.g. non monotonicity and non declarativity), we argue that it is inherently finitely reversible in the sense of [Dymetman 1991] - that is, there is a parsing/generation program for this grammar such that for any string/semantics, the program enumerates all associated semantics/strings and terminates. We show by means of examples that one and the same specification can be used both for analysis and for generation.},
      ANNOTE = {COLIURL : Gardent:1995:RDP.pdf Gardent:1995:RDP.ps Gardent:1995:RDP.dvi}
}

@Book{Grice:1995,
      AUTHOR = {Grice, Martine},
      TITLE = {The Intonation of Palermo Italian; Implications for Intonation Theory},
      YEAR = {1995},
      VOLUME = {334},
      SERIES = {Linguistische Arbeiten},
      ADDRESS = {Tübingen},
      PUBLISHER = {Max Niemeyer Verlag}
}

@Article{Grice:1995_1,
      AUTHOR = {Grice, Martine},
      TITLE = {Leading Tones and Downstep in English},
      YEAR = {1995},
      JOURNAL = {Phonology},
      VOLUME = {12},
      NUMBER = {2},
      PAGES = {183-233}
}

@InProceedings{Grice_et_al:1995,
      AUTHOR = {Grice, Martine and Benzmüller, Ralf and Savino, Michelina and Andreeva, Bistra},
      TITLE = {The Intonation of Queries and Checks across Languages: Data from Map Task Dialogues},
      YEAR = {1995},
      BOOKTITLE = {13th International Congress of Phonetic Sciences},
      PAGES = {648-651},
      ADDRESS = {Stockholm, Sweden}
}

@InProceedings{Grice_Savino:1995,
      AUTHOR = {Grice, Martine and Savino, Michelina},
      TITLE = {Low Tone versus 'sag' in Bari Italian Intonation; A Perceptual Experiment},
      YEAR = {1995},
      BOOKTITLE = {13th International Congress of Phonetic Sciences (ICPhS '95), August 13-19},
      PAGES = {658-661},
      ADDRESS = {Stockholm, Sweden}
}

@InProceedings{Grice_Savino:1995_1,
      AUTHOR = {Grice, Martine and Savino, Michelina},
      TITLE = {Intonation and Communicative Function in a Regional Variety of Italian},
      YEAR = {1995},
      BOOKTITLE = {4th International Society of Applied Psycholinguistics Congress Psycholinguistics as a Multi-Disciplinarily Connected Science''},
      ADDRESS = {Bologna}
}

@Article{Grice_Savino:1995_2,
      AUTHOR = {Grice, Martine and Savino, Michelina},
      TITLE = {Intonation and Communicative Function in a Regional Variety of Italian},
      YEAR = {1995},
      JOURNAL = {PHONUS},
      VOLUME = {1},
      PAGES = {19-32},
      URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus1/GriceSavino_PHONUS1.ps.gz},
      ABSTRACT = {This paper looks at a number of types of yes-no questions in Bari Italian: QUERIES, CHECKS and ALIGNS, as discussed in Carletta et al (1995), and another move referred to as OBJECT, which is both a response to what has just been said and a demand for clarification. The 'questioning' pitch accent identified in Grice and Savino (1995) is found in QUERIES, most ALIGNS, tentative and reasonably confident CHECKS, and OBJECTS. It is absent from very confident CHECKS or ALIGNS, in which cases the intonation pattern used is indistinguishable from that used in statements. A tripartite subcategorisation of CHECKS, according to the degree of confidence of the speaker, is reflected in the intonation by differences not only in accent type, but also in phrasing, and presence or absence of deaccenting.},
      ANNOTE = {COLIURL : Grice:1995:ICFb.pdf}
}

@InCollection{Kaplan_et_al:1995,
      AUTHOR = {Kaplan, Ronald M. and Netter, Klaus and Wedekind, Jürgen and Zaenen, Annie},
      TITLE = {Translation by Structural Correspondences},
      YEAR = {1995},
      BOOKTITLE = {Formal Issues in Lexical Functional Grammar},
      PAGES = {311-329},
      EDITOR = {Dalrymple, Mary and Kaplan, Ronald M. and Maxwell, John and Zaenen, Annie},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knwzEACL89.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knwzEACL89.entry},
      ANNOTE = {COLIURL : Kaplan:1995:TSC.pdf Kaplan:1995:TSC.ps}
}

@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{Kasper_et_al:1995_1,
      AUTHOR = {Kasper, Robert and Kiefer, Bernd and Netter, Klaus and Vijay-Shanker, Krishnamurti},
      TITLE = {Compilation of HPSG to TAG},
      YEAR = {1995},
      BOOKTITLE = {33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '95), June 26-30},
      PAGES = {92-99},
      EDITOR = {ACL},
      ADDRESS = {Cambridge, Massachusetts, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.dvi.Z},
      ANNOTE = {COLIURL : Kasper:1995:CHT.pdf Kasper:1995:CHT.ps Kasper:1995:CHT.dvi}
}

@InProceedings{Kasper_et_al:1995_2,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich and Diagne, Abdel Kader},
      TITLE = {Distributed Parsing with HPSG Grammars},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 4th International Workshop on Parsing Technologies (IWPT'95), September 20-24},
      PAGES = {79-86},
      ADDRESS = {Prague and Karlovy Vary, Czech Republic},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwpt95.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwpt95.entry},
      ANNOTE = {COLIURL : Kasper:1995:DPH.pdf Kasper:1995:DPH.ps}
}

@TechReport{Kiefer_Fettig:1995,
      AUTHOR = {Kiefer, Bernd and Fettig, Thomas},
      TITLE = {FEGRAMED - An Interactive Graphics Editor for Feature Structures},
      YEAR = {1995},
      NUMBER = {RR-95-06},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/fegramed.ps.gz ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1995/RR-95-06.ps.gz},
      ABSTRACT = {This paper describes a tool for supporting grammar development in those linguistic frameworks which employ some constraint-based formalism, such as LFG (Lexical Functional Grammar), HPSG (Head-Driven Phrase Structure Grammar), FUG (Functional Unification Grammar) and CUG (Categorial Unification Grammar). These approaches have in common that all or at least a substantial part of the grammar (such as rules, lexical entries, node labels etc.) is represented as sets of attribute-value pairs. In LISP or Prolog the structures can be internally represented as lists, but it is much more convenient and sometimes even indispensable to use graphical representations when developing grammars. During grammar processing, feature structures can become quite large (up to several thousand nodes), such that a customized view of the feature structure, which allows to selectively focus on relevant parts, becomes essential. Fegramed provides a fully interactive editor for developing, maintaining and viewing feature structures. It is a tool that is built to cope with the complexity of feature structures in grammar development and use.},
      ANNOTE = {COLIURL : Kiefer:1995:FIG.pdf Kiefer:1995:FIG.ps}
}

@TechReport{Kipper_et_al:1995,
      AUTHOR = {Kipper, Bernhard and Brants, Thorsten and Plach, Marcus and Schäfer, Ralph},
      TITLE = {Bayessche Netze: Ein einführendes Beispiel},
      YEAR = {1995},
      NUMBER = {Nr. 4},
      ADDRESS = {Saarbrücken},
      TYPE = {Bericht des Graduiertenkolleg Kognitionswissenschaft},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Kipper-ea-GKK4.pdf},
      ABSTRACT = {Bayessche Netze stellen einen vielbeachteten Formalismus zur Repräsentation und Verarbeitung von unsicherem Wissen dar. Zum Formalismus der Bayesschen Netze existieren zwar einige einführende Arbeiten; was diesen Einführungen jedoch fehlt, ist eine Illustration der innerhalb von Bayesschen Netzen verwendeten Mechanismen an Hand konkreter (Zahlen-)Beispiele. Mit der vorliegenden Arbeit soll genau diese Lücke geschlossen werden: Die grundlegende Struktur Bayesscher Netze wird durch die Modellierung eines Beispielszenarios erläutert. In dem daraus resultierenden Beispielnetz werden ferner die probabilistischen Methoden, die bei Bayesschen Netzen Anwendung finden, mit konkreten Zahlenwerten durchgerechnet.},
      ANNOTE = {COLIURL : Kipper:1995:BNE.pdf}
}

@InCollection{Konieczny_et_al:1995,
      AUTHOR = {Konieczny, Lars and Hemforth, Barbara and Scheepers, Christoph and Strube, Gerhard},
      TITLE = {PP-Attachment in German: Results from Eye Movement Studies},
      YEAR = {1995},
      BOOKTITLE = {Eye Movement Research: Mechanisms, Processes and Applications},
      PAGES = {405-420},
      EDITOR = {Findlay, John M. and Walker, R. and Kentridge, R. W.},
      ADDRESS = {Amsterdam},
      PUBLISHER = {North Holland}
}

@Article{Koreman:1995,
      AUTHOR = {Koreman, Jacques},
      TITLE = {The Effects of Stress and F0 on the Voice Source},
      YEAR = {1995},
      JOURNAL = {PHONUS},
      VOLUME = {1},
      PAGES = {105-120},
      URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Koreman_PHONUS1.ps.gz},
      ABSTRACT = {In this paper, we present data on the qualitative difference in the voice source characteristics in stressed versus unstressed syllables; for the unstressed syllables, we will further point out the qualitative differences dependent on high versus low F0 (fundamental frequency of the vocal fold vibrations). The voice source characteristics will be described in terms of a set of parameters extracted from the inverse filtered signal, consisting of the parameters OQ (open quotient), rk (pulse skewing), Ee (excitation strength), AC (peak-to-peak airflow) and DC offset (leak flow). We attempt to give a physiological explanation for our findings by comparing our data with those from other experiments, discussed in the literature. We also compare our findings with the predictions from modelling studies, and suggest some improvements of the phonation models to obtain a better correspondence between their predictions and our results. The physiological interpretation of our findings remains tentative, since no direct physiological measurements were made. Nevertheless we are able to propose a consistent explanation for the behaviour of the glottal parameter values that were observed.},
      ANNOTE = {Koreman:1995:ESF}
}

@PhdThesis{Krieger:1995,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {TDL - A Type Description Language for Constraint-Based Grammars. Foundation, Implementation, and Application},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computer Science},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diss.entry}
}

@InProceedings{Krieger:1995_1,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 4th Meeting on Mathematics of Language (MOL4), October 26-28},
      ADDRESS = {Philadelphia, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.entry},
      ANNOTE = {COLIURL : Krieger:1995:TFSa.pdf Krieger:1995:TFSa.ps}
}

@TechReport{Krieger:1995_2,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity},
      YEAR = {1995},
      NUMBER = {RR-95-20},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.entry},
      ANNOTE = {COLIURL : Krieger:1995:TFSb.pdf Krieger:1995:TFSb.ps}
}

@InProceedings{Krieger:1995_3,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Classification and Representation of Types in TDL},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use, and Storage for Efficiency, August 11-13},
      PAGES = {74-85},
      ADDRESS = {University of California, Santa Cruz, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.entry},
      ABSTRACT = {TDL is a typed feature-based representation language and inference system, specifically designed to support highly lexicalized constraint-based grammar theories. Type definitions in TDL consist of type and feature constraints over the full Boolean connectives together with coreferences, thus making TDL Turing-complete. TDL provides open- and closed-world reasoning over types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in tdl is accomplished through specialized modules. In this paper, we will highlight the type/inheritance hierarchy module of TDL and show how we represent conjunctively and disjunctively defined types. Negated types and incompatible types are handled by specialized bottom symbols. Redefining a type only leads to the redefinition of the dependent types, and not to the redefinition of the whole grammar/lexicon. Undefined types are nothing special. Reasoning over the type hierarchy is partially realized by a bit vector encoding of types, similar to the one used in Ait-Kaci's LOGIN. However, the underlying semantics does not harmonize with the open-world assumption of TDL. Thus, we have to generalize the GLB/LUB operation to account for this fact. The system, as presented in the paper, has been fully implemented in Common Lisp and is an integrated part of a large NL system. It has been installed and successfully employed at other sites and runs on various platforms.},
      ANNOTE = {COLIURL : Krieger:1995:CRTb.pdf Krieger:1995:CRTb.ps}
}

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

@TechReport{Krieger:1995_5,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Classification and Representation of Types in TDL},
      YEAR = {1995},
      NUMBER = {RR-95-17},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.ps.gz ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1995/RR-95-17.ps.gz},
      ABSTRACT = {TDL is a typed feature-based representation language and inference system, specifically designed to support highly lexicalized constraint-based grammar theories. Type definitions in TDL consist of type and feature constraints over the full Boolean connectives together with coreferences, thus making TDL Turing-complete. TDL provides open- and closed-world reasoning over types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in tdl is accomplished through specialized modules. In this paper, we will highlight the type/inheritance hierarchy module of TDL and show how we represent conjunctively and disjunctively defined types. Negated types and incompatible types are handled by specialized bottom symbols. Redefining a type only leads to the redefinition of the dependent types, and not to the redefinition of the whole grammar/lexicon. Undefined types are nothing special. Reasoning over the type hierarchy is partially realized by a bit vector encoding of types, similar to the one used in Ait-Kaci's LOGIN. However, the underlying semantics does not harmonize with the open-world assumption of TDL. Thus, we have to generalize the GLB/LUB operation to account for this fact. The system, as presented in the paper, has been fully implemented in Common Lisp and is an integrated part of a large NL system. It has been installed and successfully employed at other sites and runs on various platforms.},
      ANNOTE = {COLIURL : Krieger:1995:CRTa.pdf Krieger:1995:CRTa.ps}
}

@InProceedings{Krieger_Schäfer:1995,
      AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
      TITLE = {Efficient Parameterizable Type Expansion for Typed Feature Formalisms},
      YEAR = {1995},
      BOOKTITLE = {14th International Joint Conference on Artificial Intelligence (IJCAI '95), August 20-25},
      PAGES = {1428-1434},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.entry},
      ANNOTE = {COLIURL : Krieger:1995:EPTa.pdf Krieger:1995:EPTa.ps}
}

@TechReport{Krieger_Schäfer:1995_1,
      AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
      TITLE = {Efficient Parameterizable Type Expansion for Typed Feature Formalisms},
      YEAR = {1995},
      NUMBER = {RR-95-18},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.entry},
      ANNOTE = {COLIURL : Krieger:1995:EPTb.pdf Krieger:1995:EPTb.ps}
}

@TechReport{Lerner_Pinkal:1995,
      AUTHOR = {Lerner, Jean-Yves and Pinkal, Manfred},
      TITLE = {Comparative Ellipsis and Variable Bindings},
      YEAR = {1995},
      MONTH = {June},
      NUMBER = {64},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus64.ps},
      ABSTRACT = {In this paper, we discuss the question whether phrasal comparatives should be given a direct interpretation, or require an analysis as elliptic constructions, and answer it with Yes and No. The most adequate analysis of wide reading attributive (WRA) comparatives seems to be as cases of ellipsis, while a direct (but asymmetric) analysis fits the data for narrow scope attributive comparatives. The question whether it is a syntactic or a semantic process which provides the missing linguistic material in the complement of WRA comparatives is also given a complex answer: Linguistic context is accessed by combining a reconstruction operation and a mechanism of anaphoric reference. The analysis makes only few and straightforward syntactic assumptions. In part, this is made possible because the use of Generalized Functional Application as a semantic operation allows us to model semantic composition in a flexible way.},
      ANNOTE = {COLIURL : Lerner:1995:CEVa.pdf Lerner:1995:CEVa.ps}
}

@InProceedings{Lerner_Pinkal:1995_1,
      AUTHOR = {Lerner, Jean-Yves and Pinkal, Manfred},
      TITLE = {Comparative Ellipsis and Variable Bindings},
      YEAR = {1995},
      BOOKTITLE = {Conference on Semantics and Linguistic Theory (SALT V), February 24-26},
      EDITOR = {Simons, M. and Galloway, T.},
      ADDRESS = {University of Texas, Austin, USA},
      PUBLISHER = {DMLL Publications}
}

@Article{Li:1995,
      AUTHOR = {Li, Jie},
      TITLE = {Dou and Wh-questions in Mandarin Chinese},
      YEAR = {1995},
      JOURNAL = {Journal of East Asian Linguistics},
      VOLUME = {4},
      NUMBER = {4},
      PAGES = {313-323}
}

@TechReport{Millies:1995,
      AUTHOR = {Millies, Sebastian},
      TITLE = {Eine modulare Architektur für die syntaktisch-semantische Analyse},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {60},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus60.ps},
      ABSTRACT = {Für die Darstellung syntaktischer Strukturen und der Art des Zugriffs darauf gibt es im wesentlichen zwei Modelle: Einerseits die integrativen Modelle, in denen eine einheitliche Datenstruktur für die Repräsentation und Manipulation der verschiedenen Ebenen bereitgestellt wird, andererseits die modularen Modelle, die verschiedene, auf die speziellen Anforderungen der Ebenen abgestimmte Formalismen bieten. In diesem Papier werden die beiden Arten von Modellen diskutiert. Es wird eine modulare Architektur vorgestellt, in der von einer genuin semantischen Ebene gezielt und in kontrollierter Weise auf semantisch relevante syntaktische Information zugegriffen wird. Die Syntax wird als abstrakter Datentyp realisiert, so daß die Semantikkonstruktion unabhängig von der konkreten Darstellung syntaktischer Information beschrieben werden kann. Für drei verschiedene Grammatikformalismen (GB, LFG, HPSG) wird die Syntax-Semantik-Schnittstelle betrachtet. Die allgemeinen Grundsätze der beschriebenen Architektur sind auf den Entwurf weiterer Schnittstellen zwischen linguistischen Teilsystemen anwendbar. Schließlich wird der Kompositionalitätsbegriff im Kontext dieses Modells problematisiert.},
      ANNOTE = {COLIURL : Millies:1995:MAS.pdf Millies:1995:MAS.ps}
}

@InProceedings{Milward:1995,
      AUTHOR = {Milward, David},
      TITLE = {Incremental Interpretation of Categorial Grammar},
      YEAR = {1995},
      BOOKTITLE = {7th Conference of the European Chapter of the Association for Computational Linguistics (EACL '95), March 27-31},
      PAGES = {119-126},
      ADDRESS = {University College Dublin, Ireland}
}

@InCollection{Mineur_Buitelaar:1995,
      AUTHOR = {Mineur, Anne-Marie and Buitelaar, Paul},
      TITLE = {A Compositional Treatment of Polysemous Arguments in Categorial Grammar},
      YEAR = {1995},
      BOOKTITLE = {Semantic Ambiguity and Underspecification},
      EDITOR = {van Deemter, Kees and Peters, Stanley},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Publications}
}

@TechReport{Mineur_Buitelaar:1995_1,
      AUTHOR = {Mineur, Anne-Marie and Buitelaar, Paul},
      TITLE = {A Compositional Treatment of Polysemous Arguments in Categorial Grammar},
      YEAR = {1995},
      MONTH = {January},
      NUMBER = {49},
      PAGES = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus49.ps},
      ABSTRACT = {We discuss the extension of the standard logical rules (functional application and abstraction) in Categorial Grammar, in order to deal with some specific cases of polysemy. We borrow from Generative Lexicon theory which proposes the mechanism of coercion next to a rich nominal lexical semantic structure called qualia structure. In a previous paper we introduced coercion into the framework of sign-based Categorial Grammar and investigated its impact on traditional Fregean compositionality. In this paper we will elaborate on this idea, mostly working towards the introduction of a new semantic dimension. Where in current versions of sign-based Categorial Grammar only two representations are derived: a prosodic one (form) and a logical one (modelling), here we introduce also a more detailed representation of the lexical semantics. This extra knowledge will serve to account for linguistic phenomena like metonymy.},
      ANNOTE = {COLIURL : Mineur:1995:CTPb.pdf Mineur:1995:CTPb.ps}
}

@TechReport{Niehren:1995,
      AUTHOR = {Niehren, Joachim},
      TITLE = {Functional Computation as Concurrent Computation},
      YEAR = {1995},
      NUMBER = {RR-95-14},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI}
}

@InProceedings{Oepen_Netter:1995,
      AUTHOR = {Oepen, Stefan and Netter, Klaus},
      TITLE = {TSNLP - Test Suites for Natural Language Processing},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the Conference on Linguistic Databases, March 23-24},
      ADDRESS = {Groningen, The Netherlands},
      URL = {http://clwww.essex.ac.uk/group/projects/tsnlp/papers/tsnlp-groningen95.ps.gz},
      ANNOTE = {COLIURL : Oepen:1995:TTS.pdf Oepen:1995:TTS.ps}
}

@InProceedings{Oliva:1995,
      AUTHOR = {Oliva, Karel},
      TITLE = {Grammatikbasierte Grammarchecking},
      YEAR = {1995},
      BOOKTITLE = {5th German Student Conference on Computational Linguistics},
      ADDRESS = {Saarbrücken, Germany}
}

@Book{Peetz_Pützer:1995,
      AUTHOR = {Peetz, Anna and Pützer, Manfred},
      TITLE = {Wörterbuch der Beurener Mundart},
      YEAR = {1995},
      VOLUME = {15},
      SERIES = {Phonetica Saraviensia},
      ADDRESS = {Saarbrücken, Germany}
}

@Book{Pinkal:1995,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Logic and Lexicon. The semantics of the indefinite},
      YEAR = {1995},
      ADDRESS = {Dordrecht},
      PUBLISHER = {Kluwer Academic Publishers}
}

@InProceedings{Pinkal:1995_1,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Radical Underspecification},
      YEAR = {1995},
      BOOKTITLE = {10th Amsterdam Colloquium},
      PAGES = {587-606},
      EDITOR = {Dekker, Paul and Stokhof, Martin},
      ADDRESS = {Amsterdam, The Netherlands},
      PUBLISHER = {University of Amsterdam}
}

@InProceedings{Podelski_Smolka:1995,
      AUTHOR = {Podelski, Andreas and Smolka, Gert},
      TITLE = {Situated Simplification},
      YEAR = {1995},
      BOOKTITLE = {1st Conference on Principles and Practice of Constraint Programming, September},
      NUMBER = {976},
      PAGES = {328-344},
      EDITOR = {Montanari, U.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Cassis, France},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SituSimpliTCS.ps.gz},
      ABSTRACT = {Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., AKL or Oz). The algorithm is presented as the simplification of the constraints which form the (possibly deep) guards and which are situated at different nodes (or, local computation spaces) in a tree (of arbitrary depth). In this algorithm, each variable may have multiple bindings (representing multiple constraints on the same variable in different nodes). These may be realized by re- and de-installation upon each newly resumed check of the guard in the corresponding node (as done, e.g., in AKL or Oz), or by using look-up tables (with entries indexed by the nodes). We give a simple fixed-point algorithm and use it for proving that the tests implemented by another, practical algorithm are correct and complete for entailment and disentailment. We formulate the results in this paper for rational tree constraints; they can be adapted to finite and feature trees.},
      ANNOTE = {COLIURL : Podelski:1995:SS.pdf Podelski:1995:SS.ps}
}

@Article{Pützer:1995,
      AUTHOR = {Pützer, Manfred},
      TITLE = {Die Wortakzente von Beuren. Ein Beitrag zu Wortprosodischen Strukturen in einer Moselfränkischen Mundart},
      YEAR = {1995},
      JOURNAL = {PHONUS},
      VOLUME = {1},
      PAGES = {65-104},
      URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Puetzer_PHONUS1.ps.gz},
      ABSTRACT = {This report addresses the topic of word-accent in the dialect of the Rhine-Palatinate town of Beuren, close to the Northern Saarland border and belonging to the Mosel-Franconian dialect region. The report is presented in two thematically linked parts, and their partly complementary results contribute to a better understanding of the word-prosody structure of this dialect. The first part is a pilot study of the Rhenish Accentuation phenomena. It is an acoustic analysis of Accent 1 (also called Stoßton) and Accent 2 (also called Schleifton) words produced under different sentence-accent conditions in different intonation patterns. The second part is concernd with another tonal accent, sometimes called the neutral accent, which is assumed, on the basis of auditory judgements, to exist in the dialect of Beuren. A pilot experiment tests the perceptual contribution of durational and tonal properties to the acceptability of this accent and of accent 2.},
      ANNOTE = {COLIURL : Putzer:1995:WBB.pdf}
}

@TechReport{Ramm_et_al:1995,
      AUTHOR = {Ramm, Wiebke and Rothkegel, Annely and Steiner, Erich and Villiger, Claudia},
      TITLE = {Discourse Grammar for German},
      YEAR = {1995},
      NUMBER = {EP6665; Deliverable R2.3.2},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report ESPRIT Basic Research Action: Dandelion},
      INSTITUTION = {Universität des Saarlandes}
}

@InProceedings{Ramm_Villiger:1995,
      AUTHOR = {Ramm, Wiebke and Villiger, Claudia},
      TITLE = {Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection},
      YEAR = {1995},
      BOOKTITLE = {Recent Advances in Natural Language Processing (RANLP '95), September 11-13},
      EDITOR = {Boguraev, B.},
      ADDRESS = {Tzigov Chark, Bulgaria},
      PUBLISHER = {European Association of Computational Linguistics}
}

@TechReport{Ramm_Villiger:1995_1,
      AUTHOR = {Ramm, Wiebke and Villiger, Claudia},
      TITLE = {Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {61},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus61.ps},
      ABSTRACT = {In this paper we address aspects of the interaction of global discourse parameters such as text type and subject matter with the selection of local features (e.g., thematic organization in terms of theme-rheme configurations) responsible for the appearance of the individual linguistic units the discourse consists of. Our starting point is the observation that the same propositional content often can be expressed linguistically by different lexical and grammatical means, for instance, by word order alternatives or by using different lexical categories. These alternatives result from the exploitation of a number of linguistic mechanisms (e.g., focussing, thematization) controlling the foregrounding and backgrounding of different parts of information communicated and differ in the pragmatic effects they achieve. Our interest lies in the textual-pragmatic motivations leading to the choice of a certain textual variant; in particular, we investigate the constraints global discourse structure imposes on sentence-level discourse organization. Proceeding from a stratificational model of the language system, our approach aims at the specification of interstratal constraints expressing the interdependency between higher-level discourse organization and lexico-grammatical realization on sentence level. A possible application area would be text generation where a notorious problem is the gap between global-level text planning and lexico-grammatical expression. The choice of grammatical (sentence) theme in German and its text type and domain dependency is taken as a sample phenomenon to illustrate our methodology.},
      ANNOTE = {COLIURL : Ramm:1995:GTOb.pdf Ramm:1995:GTOb.ps}
}

@TechReport{Riezler:1995,
      AUTHOR = {Riezler, Stefan},
      TITLE = {Binding Without Hierarchies},
      YEAR = {1995},
      MONTH = {January},
      NUMBER = {50},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus50.ps},
      ABSTRACT = {The aim of this paper is to show that current HPSG binding theory (and similarly other binding approaches encoding asymmetries explicitly) is inadequate with regard to describing binding variabilities in local binding contexts. This inadequacy stems mainly from the usage of too restrictive and order-independent obliqueness-based hierarchies as constraints on possible binders and bindees. We propose binding constraints to be directly implemented as path equations/path inequations in thematic relation sorts. This allows a more fine-grained description of local binding symmetries and asymmetries via a modular interplay of general binding constraints on thematic arguments together with linear precedence constraints on certain anaphoric elements.},
      ANNOTE = {COLIURL : Riezler:1995:BH.pdf Riezler:1995:BH.ps}
}

@InProceedings{Samuelsson:1995,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {A Novel Framework for Reductionistic Statistical Parsing},
      YEAR = {1995},
      BOOKTITLE = {4th International Workshop on Parsing Technologies (IWPT '95), September 20-24},
      PAGES = {208-215},
      ADDRESS = {Prague and Karlovy Vary, Czech Republic}
}

@InProceedings{Samuelsson:1995_1,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {An Efficient Algorithm for Surface Generation},
      YEAR = {1995},
      BOOKTITLE = {14th International Joint Conference on Artificial Intelligence (IJCAI '95), August 20-25},
      VOLUME = {2},
      PAGES = {1414-1419},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers}
}

@InProceedings{Samuelsson:1995_2,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Example-Based Optimization of Surface-Generation Tables},
      YEAR = {1995},
      BOOKTITLE = {1st International Conference on Recent Advances in Natural Language Processing, September},
      EDITOR = {Boguraev, B.},
      ADDRESS = {Tzigov Chark, Bulgaria}
}

@TechReport{Samuelsson:1995_3,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Example-Based Optimization of Surface-Generation Tables},
      YEAR = {1995},
      MONTH = {April},
      NUMBER = {56},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {A method is given that 'inverts' a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform 'functor merging' much in the same way as an LR parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space. The amount of semantic lookahead can be varied, and appropriate tradeoff points between table size and resulting nondeterminism can be found automatically. This can be done by removing all spurious nondeterminism for input sufficiently close to the examples of a training corpus, and large portions of it for other input, while preserving completeness.}
}

@InProceedings{Santamarta_et_al:1995,
      AUTHOR = {Santamarta, Lena and Lindberg, Nikolaj and Gambäck, Björn},
      TITLE = {Towards Building a Swedish Treebank},
      YEAR = {1995},
      BOOKTITLE = {10th Nordic Conference of Computational Linguistics, May 30-31},
      PAGES = {37-40},
      ADDRESS = {Helsinki, Finland},
      URL = {www.sics.se/humle/papers/nodalida95_tree.ps},
      ANNOTE = {COLIURL : Santamarta:1995:TBS.pdf Santamarta:1995:TBS.ps}
}

@MastersThesis{Schäfer:1995,
      AUTHOR = {Schäfer, Ulrich},
      TITLE = {Parameterized Type Expansion in TDL},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes}
}

@MastersThesis{Schäfer:1995_1,
      AUTHOR = {Schäfer, Ulrich},
      TITLE = {Parameterized Type Expansion in the Feature Structure Formalism TDL},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes},
      URL = {http://www.dfki.de/dfkibib/publications/docs/usthesis.pdf},
      ABSTRACT = {Over the last few years, unification-based grammar formalisms have become the predominant paradigm in natural language processing systems because of their monotonicity, declarativeness, and reversibility. From the viewpoint of computer science, typed feature structures can be seen as data structures that allow representation of linguistic knowledge in a uniform fashion. Type expansion is an operation that makes the constraints on a typed feature structure explicit and determines their satisfiability. We describe an efficient expansion algorithm that takes care of recursive type definitions and allows exploration of different expansion strategies through the use of control knowledge. This knowledge is specified in a separate layer, independently of grammatical information. Memoization of the type expansion function drastically reduces the number of unifications. In the second part, nonmonotonic extensions to TDL and the implementation of well-typedness checks are presented. Both are closely related to the type expansion algorithm. The algorithms have been implemented in Common Lisp and are integrated parts of TDL and a large natural language dialog system.},
      ANNOTE = {COLIURL : Schafer:1995:PTEb.pdf}
}

@InProceedings{Siegel:1995,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Problems of Automatic Translation of Japanese Dialogues into German},
      YEAR = {1995},
      BOOKTITLE = {Machine Translation and Machine Interpretation. Proceedings of the VERBMOBIL Workshop at the University of Hamburg, October},
      EDITOR = {von Hahn, Walther and Jekat, S. and Maleck, I.},
      ADDRESS = {Hamburg, Germany},
      PUBLISHER = {Computer Science Department, University Hamburg},
      URL = {http://www.dfki.de/~siegel/hamburg.ps.gz},
      ANNOTE = {COLIURL : Siegel:1995:PAT.pdf Siegel:1995:PAT.ps}
}

@MastersThesis{Skut:1995,
      AUTHOR = {Skut, Wojciech},
      TITLE = {Underspecification-Based Representation of Noun Phrase Semantics},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics}
}

@InProceedings{Steingrimsson_et_al:1995,
      AUTHOR = {Steingrimsson, P. and Markussen, B. and Andersen, Ove and Dalsgaard, Paul and Barry, William J.},
      TITLE = {From Acoustic Signal to Phonetic Features: A Dynamically Constrained Self-Organising Neural Network},
      YEAR = {1995},
      BOOKTITLE = {13th International Congress of Phonetic Sciences (ICPhS), August 13-19},
      VOLUME = {4},
      PAGES = {316-319},
      ADDRESS = {Stockholm, Sweden}
}

@InProceedings{Thalmann_Samuelsson:1995,
      AUTHOR = {Thalmann, Lars and Samuelsson, Christer},
      TITLE = {A Uniform Framework for Grammar Induction and Robust Parsing},
      YEAR = {1995},
      BOOKTITLE = {5th Scandinavian Conference on Artificial Intelligence, (SCAI '95), May},
      ADDRESS = {Trondheim, Norway}
}

@Proceedings{Hans:1995,
      TITLE = {33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '95). Proceedings of the Conference},
      YEAR = {1995},
      EDITOR = {Uszkoreit, Hans},
      ADDRESS = {Cambridge, USA},
      PUBLISHER = {ACL},
      URL = {http://xxx.unizar.es/cmp-lg/ACL-95-proceedings.html}
}

@TechReport{Villiger:1995,
      AUTHOR = {Villiger, Claudia},
      TITLE = {Theme Discourse Topic, and Information Structuring in German Texts},
      YEAR = {1995},
      MONTH = {December},
      NUMBER = {EP6665; Deliverable R1.2.2c},
      ADDRESS = {Saarbrücken},
      TYPE = {ESPRIT Basic Research Action: Dandelion},
      INSTITUTION = {Universität des Saarlandes}
}

@TechReport{Worm:1995,
      AUTHOR = {Worm, Karsten},
      TITLE = {An Experiment with LUDRs in Oz},
      YEAR = {1995},
      NUMBER = {30},
      ADDRESS = {Saarbrücken},
      TYPE = {Vermobil Technisches Dokument},
      INSTITUTION = {Universität des Saarlandes}
}

@Article{Ziff_et_al:1995,
      AUTHOR = {Ziff, Donald A. and Spackmann, Stephen and Waclena, Keith},
      TITLE = {Funser: A Functional Server for Textual Information Retrieval},
      YEAR = {1995},
      JOURNAL = {Journal of Functional Programming},
      VOLUME = {5},
      NUMBER = {3},
      PAGES = {317-343},
      ANNOTE = {COLIURL : Ziff:1995:FFS.pdf}
}

@Article{Korbayova:1995,
      AUTHOR = {Korbayova, Ivana},
      TITLE = {Contextual reference of noun phrases in Plinius: Part Two},
      YEAR = {1995},
      JOURNAL = {Prague Bulletin of Mathematical Linguistics},
      VOLUME = {62},
      PAGES = {47-72},
      NOTE = {Charles University, Prague, Czech Republic}
}