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




@InProceedings{Gabsdil_et_al:2001,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Building a Text Adventure on Description Logic},
      YEAR = {2001},
      BOOKTITLE = {KI-2001 Workshop on Applications of Description Logics, September 18},
      VOLUME = {44},
      EDITOR = {Görz, Günther and Haarslev, V. and Lutz, C. and Möller, R.},
      ADDRESS = {Vienna, Austria},
      PUBLISHER = {CEUR Workshop Proceedings},
      URL = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-44/Gabsdil-et-al.ps.gz},
      ABSTRACT = {We describe an engine for a computer game which employs techniques from computational linguistics and theorem proving based on description logic. We show how we represent a world model as a DL knowledge base and then illustrate how we use it in the computational linguistics modules with the examples of analyzing and generating referring expressions.},
      ANNOTE = {COLIURL : Gabsdil:2001:BTA.pdf Gabsdil:2001:BTA.ps}
}

@InProceedings{Gabsdil_et_al:2001_1,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Playing with Description Logic},
      YEAR = {2001},
      BOOKTITLE = {2nd Workshop on Methods for Modalities (M4M). Application Description, November 29-30},
      ADDRESS = {University of Amsterdam, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/m4m2.ps.gz},
      ABSTRACT = {We describe an engine for a computer game which has at its core a description logic knowledge base and employs techniques from computational linguistics for its natural language user interface. We show how we represent the state of the game as a DL knowledge base, how we model changes in the world, and how the computational linguistics modules access the knowledge base to analyze the input wrt. the context and produce contextually appropriate output.},
      ANNOTE = {COLIURL : Gabsdil:2001:PDL.pdf Gabsdil:2001:PDL.ps}
}

@InProceedings{Gabsdil_et_al:2002,
      AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Natural Language and Inference in a Computer Game},
      YEAR = {2002},
      BOOKTITLE = {19th International Conference on Computational Linguistics (COLING '02), August 24 - September 1},
      ADDRESS = {Taipei, Taiwan},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/game-nl.ps.gz},
      ABSTRACT = {We present an engine for text adventures -- computer games with which the player interacts using natural language. The system employs current methods from computational linguistics and an efficient inference system for description logic to make the interaction more natural. The inference system is especially useful in the linguistic modules dealing with reference resolution and generation and we show how we use it to rank different readings in the case of referential and syntactic ambiguities. It turns out that the player's utterances are naturally restricted in the game scenario, which simplifies the language processing task.},
      ANNOTE = {COLIURL : Gabsdil:2002:NLI.pdf Gabsdil:2002:NLI.ps}
}

@InProceedings{Gabsdil_Striegnitz:1999,
      AUTHOR = {Gabsdil, Malte and Striegnitz, Kristina},
      TITLE = {Classifying Scope Ambiguities},
      YEAR = {1999},
      BOOKTITLE = {1st Workshop on Inference in Computational Semantics (ICoS-1), August 15},
      PAGES = {125-131},
      EDITOR = {Monz, Christof and de Rijke, Maarten},
      ADDRESS = {Amsterdam, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/icos99.ps.gz},
      ABSTRACT = {We describe the architecture and implementation of a system which compares semantic representations of natural language input w.r.t. equivalence of logical content and context change potential. Giving a clear graphical representation of the relationship between different readings, the stand-alone version of the system can be used as a classroom tool. Furthermore the core system can be incorporated into other discourse processing systems (e.g. Johan Bos' DORIS system (Bos 1998) where one might want to ignore logically equivalent readings in order to keep the number of readings small and thus improve efficiency. The system relies heavily on existing implementations and code available via the internet. These are integrated and put to the desired use by a Prolog interface. By illustrating the architecture of this system, we want to argue that it is possible to build rather complex systems involving multiple levels of linguistic processing without having to spend an unreasonably large amount of time on the implementation of basic functionalities.},
      ANNOTE = {COLIURL : Gabsdil:1999:CSA.pdf Gabsdil:1999:CSA.ps}
}

@Article{Gabsdil_Striegnitz:2000,
      AUTHOR = {Gabsdil, Malte and Striegnitz, Kristina},
      TITLE = {Classifying Scope Ambiguities},
      YEAR = {2000},
      JOURNAL = {Journal of Language and Computation},
      VOLUME = {1},
      NUMBER = {2},
      PAGES = {291-297},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/jlac2000.ps.gz},
      ABSTRACT = {We describe the architecture and implementation of a system which compares semantic representations of natural language input w.r.t. equivalence of logical content and context change potential. By using automated theorem proving we compute a graph-like structure which represents the relationships that hold between different readings of a given sentence. The information encoded in the graph-structure can be useful for discourse processing systems where knowledge about the relative logical strength of readings might be used to reduce the number of readings that have to be considered during processing. The system relies heavily on existing implementations and code available via the internet. These are integrated and put to the desired use by a Prolog interface. By illustrating the architecture of this system, we want to argue that it is possible to build rather complex systems involving multiple levels of linguistic processing without having to spend an unreasonably large amount of time on the implementation of basic functionalities.},
      ANNOTE = {COLIURL : Gabsdil:2000:CSA.pdf Gabsdil:2000:CSA.ps}
}

@InProceedings{Gardent_Striegnitz:2001,
      AUTHOR = {Gardent, Claire and Striegnitz, Kristina},
      TITLE = {Generating Indirect Anaphora},
      YEAR = {2001},
      BOOKTITLE = {4th International Workshop on Computational Semantics (IWCS-4), January 10-12},
      ADDRESS = {Tilburg, The Netherlands},
      URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/iwcs4.ps.gz},
      ABSTRACT = {Much information in natural language can be left implicit. From the generation perspective, this raises the problem of how to model the processes and in particular, the reasoning, underlying such implicitness. In this paper, we concentrate on the generation of one of the many natural language constructs supporting implicitness namely, indirect anaphora. We first summarize the inferences governing the use of indirect anaphors. We then show how indirect anaphors can be generated within a generation architecture which interleaves sentence realization with contextual reasoning.},
      ANNOTE = {COLIURL : Gardent:2001:GIA.pdf Gardent:2001:GIA.ps}
}

@InProceedings{Koller_et_al:1999,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Striegnitz, Kristina},
      TITLE = {Relaxing Underspecified Semantic Representations for Reinterpretation},
      YEAR = {1999},
      BOOKTITLE = {6th Meeting on Mathematics of Language (MOL6), July 23-25},
      PAGES = {74-87},
      ADDRESS = {Orlando, Florida, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Relax99.ps.gz},
      ABSTRACT = {Type and sort conflicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which conflicts are avoided by underspecification. The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing underspecified representations bears the danger of overgeneration. In this paper, we investigate this problem in the framework of CLLS, where underspecified representations are expressed by tree descriptions subsuming dominance constraints. We introduce some novel properties of dominance constraints and present a safety criterion that ensures that an underspecified description can be relaxed without adding unwanted readings. We then apply this criterion systematically to Egg's analysis and show why its relaxation operation does not lead to overgeneration.},
      ANNOTE = {COLIURL : Koller:1999:RUS.pdf Koller:1999:RUS.ps}
}

@Article{Koller_et_al:2000_1,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Striegnitz, Kristina},
      TITLE = {Relaxing Underspecified Semantic Representations for Reinterpretation},
      YEAR = {2000},
      JOURNAL = {Grammars},
      VOLUME = {3},
      NUMBER = {2-3},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/relax2000.ps.gz},
      ABSTRACT = {Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation. We elaborate on the foundations of a recent approach to reinterpretation within a framework for semantic underspecification. In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of reinterpretation operators. Unfortunately, a structural danger of overgeneration is inherent to the relaxation of underspecified semantic representations. We identify the problem and distinguish structural properties that avoid it. We furthermore develop techniques for proving these properties and apply them to prove the safety of relaxation in a prototypical syntax/semantics interface. In doing so, we present some novel properties of tree descriptions in the constraint language over lambda structures (CLLS).},
      ANNOTE = {COLIURL : Koller:2000:RUS.pdf Koller:2000:RUS.ps}
}

@InProceedings{Koller_Striegnitz:2002,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Generation as Dependency Parsing},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the 40th Anniversary Meeting of the Association of Computational Linguistics (ACL2002), July 6-12},
      ADDRESS = {University of Pennsylvania, Philadelphia},
      URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/acl2002.ps.gz https://www.coli.uni-saarland.de/~koller/papers/gen-dg.ps.gz},
      ABSTRACT = {Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worst-case complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because optimizations in recent dependency parsers based on constraint programming tackle exactly the combinatorics that make generation hard. Indeed, initial experiments display promising runtimes.},
      ANNOTE = {COLIURL : Koller:2002:GDP.pdf Koller:2002:GDP.ps}
}

@InProceedings{Korthals:2001,
      AUTHOR = {Korthals, Christian},
      TITLE = {Self Embedded Relative Clauses in a Corpus of German Newspaper Texts},
      YEAR = {2001},
      BOOKTITLE = {6th ESSLLI Student Session, August 13-24},
      PAGES = {179-190},
      EDITOR = {Striegnitz, Kristina},
      ADDRESS = {Helsinki, Finland},
      URL = {https://www.coli.uni-saarland.de/~kris/esslli/proc.ps.gz},
      ABSTRACT = {The distribution of center self-embeddings and extrapositions in German is assumed to minimize memory load during parsing. Self-embedded relative clauses were semi-automatically analysed in a treebank of German newspaper texts. Clause length and especially extraposition distance are found as the main distinctive parameters.},
      ANNOTE = {COLIURL : Korthals:2001:SER.pdf Korthals:2001:SER.ps}
}

@MastersThesis{Striegnitz:1999,
      AUTHOR = {Striegnitz, Kristina},
      TITLE = {On Modeling Meaning Shifts by Relaxing Underspecified Semantic Representations},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes},
      TYPE = {Diplomarbeit},
      URL = {https://www.coli.uni-saarland.de/cl/projects/chorus/papers/kris99.html},
      ABSTRACT = {The context in which a word appears in natural language often influences its interpretation in such a way that the base meaning of the word is changed or made more specific. Polysemy and metonymy are examples for this phenomenon. These meaning shifts of words can be modeled by augmenting the semantic representation of a natural language utterance with the information that is missing to make the shift in meaning explicit. This information can be provided by linguistic or non-linguistic sources or an interaction of both. Recently, Egg (1999) has suggested an account of meaning shifts which exploits underspecification methods to yield a monotonic augmentation process. The main idea is to have semantic construction derive a sufficiently relaxed (i.e. made less specific) semantic representation, so that adding the missing information is simply further specification of this representation. This thesis will examine a treatment of meaning shifts due to systematic polysemy or metonymy within Egg's framework. We will present a syntax/semantics interface which derives appropriately relaxed semantic representations. To account for meaning shifts these representations can be augmented monotonically with additional information. We will point out a potential problem for this approach: making underspecified semantic representations less specific may cause overgeneration. However, as we will show, for our applications relaxation is safe, i.e. there is no danger of overgeneration. The underspecification formalism that we will use throughout this thesis is in the class of tree description languages subsuming dominance constraints. We will distinguish a novel class of subconstraints with a certain structure which powerfully support the type of inferences on dominance and disjointness which we have to make for proving safety of relaxation.},
      ANNOTE = {COLIURL : Striegnitz:1999:MMS.pdf Striegnitz:1999:MMS.ps}
}

@InProceedings{Striegnitz:2001,
      AUTHOR = {Striegnitz, Kristina},
      TITLE = {Model Checking for Contextual Reasoning in NLG},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of Inference in Computational Semantics (ICoS-3), June 18-23},
      PAGES = {101-115},
      EDITOR = {Blackburn, Patrick and Kohlhase, Michael},
      ADDRESS = {Siena, Italy},
      URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/icos3.ps.gz},
      ABSTRACT = {Presupposition triggers, such as e.g. 'the', 'too', 'another', impose constraints on the context they are used in. A violation of these constraints results in an infelicitous utterance. A natural language generation system therefore has to reason on the context to check that they are satisfied. We argue that this kind of contextual reasoning is essentially a model checking task and demonstrate this for a variety of presupposition triggers. To account for the influence of some background knowledge, we propose to embed queries to a description logic knowledge base in a first order model checking algorithm.},
      ANNOTE = {COLIURL : Striegnitz:2001:MCC.pdf Striegnitz:2001:MCC.ps}
}

@Proceedings{Kristina:2001,
      TITLE = {Proceedings of the ESSLLI'01 Student Session, August 13-24},
      YEAR = {2001},
      EDITOR = {Striegnitz, Kristina},
      ADDRESS = {Helsinki, Finland},
      URL = {https://www.coli.uni-saarland.de/~kris/esslli/proc.ps.gz},
      ANNOTE = {COLIURL : Striegnitz:2001:PES.pdf Striegnitz:2001:PES.ps}
}

@InCollection{Egg_Striegnitz:2003,
      AUTHOR = {Egg, Markus and Striegnitz, Kristina},
      TITLE = {Type coercion from a natural language generation point of view},
      YEAR = {2003},
      BOOKTITLE = {Mediating between Concepts and Grammar},
      VOLUME = {152},
      PAGES = {323--348},
      EDITOR = {Härtel, Holden and Tappe, Heike},
      SERIES = {Trends in Linguistics},
      ADDRESS = {Berlin},
      PUBLISHER = {Mouton de Gruyter},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/typegen.ps.gz}
}

@InCollection{Gardent_et_al:2004,
      AUTHOR = {Gardent, Claire and Manuélian, Hélène and Striegnitz, Kristina and Amoia, Marilisa},
      TITLE = {Generating Definite Descriptions: Non incrementality, inference and data},
      YEAR = {2004},
      BOOKTITLE = {Multidisciplinary Approaches to Language Production},
      PAGES = {53--85},
      EDITOR = {Pechman, T. and Habel, Christopher},
      ADDRESS = {Berlin},
      PUBLISHER = {Mouton de Gruyter},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/spp-book.ps.gz}
}

@Article{Koller_et_al:2004,
      AUTHOR = {Koller, Alexander and Debusmann, Ralph and Gabsdil, Malte and Striegnitz, Kristina},
      TITLE = {Put my galakmid coin into the dispenser and kick it: Computational Linguistics and Theorem Proving in a Computer Game},
      YEAR = {2004},
      JOURNAL = {Journal of Logic, Language and Information: Special Issue on ICoS-3},
      VOLUME = {13},
      NUMBER = {2},
      PAGES = {187--206},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/kluwer2004.ps.gz}
}

@InProceedings{Striegnitz:2004,
      AUTHOR = {Striegnitz, Kristina},
      TITLE = {Two Kinds of Alternative Sets and a Marking Principle --- When to Say also},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the Third International Conference on Natural Language Generation (INLG04)},
      ADDRESS = {Striegnitz:2004:TKA},
      URL = {https://www.coli.uni-saarland.de/~kris/papers/inlg2004.pdf},
      NOTE = {Presented in the Student Session of INLG04}
}

@InProceedings{ArKoSt2008,
      AUTHOR = {Areces, Carlos and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {Referring expressions as formulas of description logic},
      YEAR = {2008},
      BOOKTITLE = {INLG 2008 : Fifth International Natural Language Generation Conference ; proceedings ; June 12–14, 2008 Salt Fork, Ohio, USA},
      PAGES = {42-49},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK, MP}
}

@InProceedings{ByKoStCaDaMoOb2009,
      AUTHOR = {Byron, Donna and Koller, Alexander and Striegnitz, Kristina and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {Report on the first NLG Challenge on Generating Instructions in Virtual Environments (GIVE)},
      YEAR = {2009},
      BOOKTITLE = {ENLG 2009 : 12th European Workshop on Natural Language Generation ; proceedings of the workshop ; March30 & 31, 2009; Athens, Greece},
      PAGES = {165-173},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{KoByCaDaStMoOb2009,
      AUTHOR = {Koller, Alexander and Byron, Donna and Cassell, Justine and Dale, Robert and Striegnitz, Kristina and Moore, Johanna and Oberlander, Jon},
      TITLE = {The software architecture for the first Challenge on Generating Instructions in Virtual Environments},
      YEAR = {2009},
      BOOKTITLE = {EACL 2009 : proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, 30 March – 3 April 2009, Megaron Athens International Conference Centre, Athens, Greece},
      PAGES = {33-36},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{KoStByCaDaDaMoOb2009,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Byron, Donna and Cassell, Justine and Dale, Robert and Dazel-Job, Sara and Moore, Johanna and Oberlander, Jon},
      TITLE = {Validating the web-based evaluation of NLG systems},
      YEAR = {2009},
      BOOKTITLE = {Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and 4th International Joint Conference on Natural Language Processing of the AFNLP : proceedings of the conference, 2-7 August 2009, Suntec, Singapore ; ACL-IJCNL},
      PAGES = {301-304},
      ADDRESS = {Stroudsburg, Pa.},
      ORGANIZATION = {ACL},
      NOTE = {AK}
}

@InProceedings{KoStGaByCaDaMoOb2010,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Gargett, Andrew and Byron, Donna and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {Report on the Second NLG Challenge on Generating Instructions in Virtual Environments (GIVE-2).},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the International Natural Language Generation Conference (INLG), Dublin.},
      NOTE = {AK}
}

@InProceedings{GaGaKoSt2010,
      AUTHOR = {Gargett, Andrew and Garoufi, Konstantina and Koller, Alexander and Striegnitz, Kristina},
      TITLE = {The GIVE-2 Corpus of Giving Instructions in Virtual Environments.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 7th International Conference on Language Resources and Evaluation (LREC), Malta.},
      NOTE = {AK}
}

@InCollection{KoStByCaDaMoOb2010,
      AUTHOR = {Koller, Alexander and Striegnitz, Kristina and Byron, Donna and Cassell, Justine and Dale, Robert and Moore, Johanna and Oberlander, Jon},
      TITLE = {The First Challenge on Generating Instructions in Virtual Environments.},
      YEAR = {2010},
      BOOKTITLE = {Empirical Methods in Natural Language Generation},
      EDITOR = {Kramer, Emiel and Theune, Mariet},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer},
      NOTE = {AK}
}