% % GENERATED FROM https://www.coli.uni-saarland.de % by : anonymous % IP : coli2006.lst.uni-saarland.de % at : Mon, 05 Feb 2024 15:42:33 +0100 GMT % % Selection : Author: Katrin_Erk % @InProceedings{Bodirsky_et_al:2001, AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim}, TITLE = {Beta Reduction Constraints}, YEAR = {2001}, BOOKTITLE = {12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24}, PAGES = {31-46}, EDITOR = {Middeldorp, Aart}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Utrecht, The Netherlands}, PUBLISHER = {Springer-Verlag}, URL = {https://www.coli.uni-saarland.de/~koller/papers/beta.ps.gz}, ABSTRACT = {The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.}, ANNOTE = {COLIURL : Bodirski:2001:BRC.pdf Bodirsky:2001:BRC.ps} } @InProceedings{Bodirsky_et_al:2001_1, AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim}, TITLE = {Underspecified Beta Reduction}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11}, PAGES = {74-81}, ADDRESS = {Toulouse, France}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/usp-beta.ps.gz https://www.coli.uni-saarland.de/~koller/papers/usp-beta.ps.gz}, ABSTRACT = {For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $lambda$-structures (CLLS).}, ANNOTE = {COLIURL : Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps} } @InProceedings{Egg_Erk:2002, AUTHOR = {Egg, Markus and Erk, Katrin}, TITLE = {A Compositional Account of VP Ellipsis}, YEAR = {2002}, BOOKTITLE = {Proceedings of the 8th International Conference on Head-Driven Phrase Structure Grammar, August 3-5}, PAGES = {162-179}, EDITOR = {Van Eynde, Frank and Hellan, Lars and Beermann, Dorothee}, ADDRESS = {Stanford}, PUBLISHER = {CSLI Publications}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ellhpsg01.ps.gz}, ABSTRACT = {We present an approach to VP ellipsis that allows the direct derivation of source and target sentences (the former need not be unique) during semantic construction. Specific syntactic constituent structures are associated with ellipsis potential, which can then be discharged by pro-verbs like 'did (too)'. The determination of source and target sentence, which is done with semantic features in an HPSG framework, is coupled with a comprehensive analysis of ellipsis, which also handles its interaction with scope and anaphora.}, ANNOTE = {COLIURL : Egg:2002:CAV.pdf Egg:2002:CAV.ps} } @InProceedings{Erk:1999, AUTHOR = {Erk, Katrin}, TITLE = {Simulating Boolean Circuits by Finite Splicing}, YEAR = {1999}, BOOKTITLE = {Congress on Evolutionary Computation (CEC '99), July 16-19}, PAGES = {1279-1285}, ADDRESS = {La Jolla Marriott, San Diego, USA}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ErkBoolCirc99.ps.gz}, ABSTRACT = {As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by [Ogihara/Ray 96] and [Amos/Dunne97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination. We argue that using an abstract model of DNA computation as a basis leads to simulations of greater clarity and generality. In our construction, the running time of the simulating system is proportional to the depth, and the use of material is proportional to the size of the Boolean circuit simulated. However, the rules of the simulating splicing system depend on the size of the Boolean circuit, but not on the connectives used.}, ANNOTE = {COLIURL : Erk:1999:SBC.pdf Erk:1999:SBC.ps} } @InProceedings{Erk:2000, AUTHOR = {Erk, Katrin}, TITLE = {Die Verarbeitung von Parallelismus-Constraints}, YEAR = {2000}, BOOKTITLE = {Informatik 2000 - 30. Jahrestagung der Gesellschaft für Informatik, 19.-22. September}, EDITOR = {Mehlhorn, Kurt and Snelting, G.}, SERIES = {Informatik Aktuell}, ADDRESS = {Berlin, Germany}, PUBLISHER = {Springer}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/GI00.ps.gz}, ABSTRACT = {Parallelismus-Constraints sind partielle Beschreibungen von Bäumen. Wir verwenden sie als Repräsentationsformalismus in der unterspezifizierten natürlichsprachlichen Semantik. Parallelismus-Constraints sind gleichmächtig wie Kontext-Unifikation, deren Entscheidbarkeit ein bekanntes offenes Problem ist. Dieser Text beschreibt ein Semi-Entscheidungs-Verfahren für Parallelismus-Constraints und eine erste Implementierung. Anders als alle bekannten Verfahren für Kontext-Unifikation terminiert diese Prozedur für Dominanz-Constraints, eine für die linguistische Anwendung wichtige Teilklasse.}, ANNOTE = {COLIURL : Erk:2000:VPC.pdf Erk:2000:VPC.ps} } @InProceedings{Erk_Koller:2001, AUTHOR = {Erk, Katrin and Koller, Alexander}, TITLE = {VP Ellipsis by Tree Surgery}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 13th Amsterdam Colloquium, December 17-19}, ADDRESS = {Amsterdam}, URL = {https://www.coli.uni-saarland.de/~koller/papers/jigsaw.ps.gz}, ABSTRACT = {We present jigsaw parallelism constraints, a flexible formal tool for replacing parts of trees with other trees. Jigsaw constraints extend the Constraint Language for Lambda Structures, a language used in underspecified semantics to declaratively describe scope, ellipsis, and their interaction, and can be used to improve the coverage of ellipses represented by CLLS.}, ANNOTE = {COLIURL : Erk:2001:VET.pdf Erk:2001:VET.ps} } @Article{Erk_et_al:2003, AUTHOR = {Erk, Katrin and Koller, Alexander and Niehren, Joachim}, TITLE = {Processing Underspecified Semantic Descriptions in the Constraint Language for Lambda Structures}, YEAR = {2003}, JOURNAL = {Research on Language and Computation}, VOLUME = {1}, PAGES = {127--169}, URL = {https://www.coli.uni-saarland.de/~koller/papers/cllsproc.ps.gz}, ABSTRACT = {The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions which combines dominance constraints with powerful parallelism and binding constraints. CLLS was introduced as a uniform framework for defining underspecified semantics representations of natural language sentences, covering scope, ellipsis, and anaphora. This article presents saturation-based algorithms for processing the complete language of CLLS and gives an overview of previous results on questions of processing and complexity.}, ANNOTE = {COLIURL : Erk:2002:PUS.pdfErk:2002:PUS.ps} } @InProceedings{Erk_Kruijff:2002, AUTHOR = {Erk, Katrin and Kruijff, Geert-Jan M.}, TITLE = {A Constraint-Programming Approach to Parsing with Resource-Sensitive Categorial Grammar}, YEAR = {2002}, BOOKTITLE = {Proceedings of the 7th International Workshop on Natural Language Understanding and Logic Programming (NLULP'02), July 28}, EDITOR = {Wintner, Shuly}, ADDRESS = {Copenhagen, Denmark}, PUBLISHER = {Computer Science Department, Roskilde University}, URL = {http://www.cs.haifa.ac.il/~shuly/nlulp02/papers/ErkKruijff.pdf}, ABSTRACT = {Parsing with resource-sensitive categorial grammars (up to the Lambek-Van Benthem calculus LP) is an NP-complete problem. The traditional approach to parsing with such grammars is based on generate & test and cannot avoid this high worst-case complexity. This paper proposes an alternative approach, based on constraint programming: Given a grammar, constraints formulated on an abstract interpretation of the grammar's logical structure are used to prune the search space during parsing. The approach is provably sound and complete, and reduces the search space in steps that are mostly linear or low-polynomial.}, ANNOTE = {Erk:2002:CPA} } @InProceedings{Erk_Niehren:2000, AUTHOR = {Erk, Katrin and Niehren, Joachim}, TITLE = {Parallelism Constraints}, YEAR = {2000}, BOOKTITLE = {11th International Conference on Rewriting Techniques and Applications (RTA '00), July 10-12}, EDITOR = {Bachmair, L.}, SERIES = {LNCS}, ADDRESS = {University of East Anglia, Norwich, UK}, PUBLISHER = {Springer}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/parallelism.ps.gz}, ABSTRACT = {Parallelism constraints are logical desciptions of trees. They are as expressive as context unification, i.e. second-order linear unification. We present a semi-decision procedure enumerating all most general unifiers of a parallelism constraint and prove it sound and complete. In contrast to all known procedures for context unification, the presented procedure terminates for the important fragment of dominance constraints and performs reasonably well in a recent application to underspecified natural language semantics.}, ANNOTE = {COLIURL : Erk:2000:PC.ps} } @Book{Erk_Priese:2000, AUTHOR = {Erk, Katrin and Priese, Lutz}, TITLE = {Theoretische Informatik. Eine umfassende Einführung}, YEAR = {2000}, ADDRESS = {Berlin}, PUBLISHER = {Springer} } @InProceedings{Baldewein_et_al:2004, AUTHOR = {Baldewein, Ulrike and Erk, Katrin and Pado, Sebastian and Prescher, Detlef}, TITLE = {Semantic Role Labelling for Chunk Sequences}, YEAR = {2004}, BOOKTITLE = {Proceedings of the CoNLL'04 shared task}, ADDRESS = {Boston, MA}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/conll.ps} } @InProceedings{Baldewein_et_al:2004_1, AUTHOR = {Baldewein, Ulrike and Erk, Katrin and Pado, Sebastian and Prescher, Detlef}, TITLE = {Semantic Role Labelling with Similarity-Based Generalization Using EM-based Clustering}, YEAR = {2004}, BOOKTITLE = {Proceedings of Senseval'04}, ADDRESS = {Barcelona}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/senseval.ps} } @InProceedings{Erk_et_al:2003_1, AUTHOR = {Erk, Katrin and Kowalski, Andrea and Pado, Sebastian and Pinkal, Manfred}, TITLE = {Creating a Resource for Lexical Semantics}, YEAR = {2003}, BOOKTITLE = {Proceedings of the Workshop on Frame Semantics, CIL-17}, ADDRESS = {Prague, Czechia}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/CIL.ps} } @InProceedings{Erk_et_al:2003_2, AUTHOR = {Erk, Katrin and Kowalski, Andrea and Pado, Sebastian and Pinkal, Manfred}, TITLE = {Building a Resource for Lexical Semantics}, YEAR = {2003}, BOOKTITLE = {Proceedings of the Workshop on Frame Semantics, XVII. International Congress of Linguists (CIL)}, ADDRESS = {Prague, Czech Republic}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/CIL.ps} } @InProceedings{Erk_et_al:2003_3, AUTHOR = {Erk, Katrin and Kowalski, Andrea and Pado, Sebastian and Pinkal, Manfred}, TITLE = {Towards a Resource for Lexical Semantics: A Large German Corpus with Extensive Semantic Annotation}, YEAR = {2003}, BOOKTITLE = {Proceedings of ACL-03}, ADDRESS = {Sapporo, Japan}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/ACL03.ps} } @InProceedings{PaPaEr2007, AUTHOR = {Pado, Sebastian and Pado, Ulrike and Erk, Katrin}, TITLE = {Flexible, Corpus-Based Modelling of Human Plausibility Judgements}, YEAR = {2007}, BOOKTITLE = {EMNLP. Prague}, NOTE = {MC, MP} } @InProceedings{Ellsworth_et_al:2004, AUTHOR = {Ellsworth, Michael and Erk, Katrin and Kingsbury, Paul and Pado, Sebastian}, TITLE = {PropBank, SALSA, and FrameNet: How Design Determines Product}, YEAR = {2004}, BOOKTITLE = {Proceedings of the LREC 2004 Workshop on Building Lexical Resources from Semantically Annotated Corpora}, ADDRESS = {Lisbon}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/pb-fn.ps} } @PhdThesis{Erk:2002, AUTHOR = {Erk, Katrin}, TITLE = {Parallelism Constraints in Underspecified Semantics}, YEAR = {2002}, MONTH = {December}, SCHOOL = {Saarland University}, URL = {http://www.ps.uni-sb.de/Papers/abstracts/disserk.html} } @InProceedings{Erk_et_al:2003_4, AUTHOR = {Erk, Katrin and Kowalski, Andrea and Pinkal, Manfred}, TITLE = {A Corpus Resource for Lexical Semantics}, YEAR = {2003}, BOOKTITLE = {Proceedings of IWCS5}, ADDRESS = {Tilburg}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/LexProj.ps} } @InProceedings{Erk_Niehren:2003, AUTHOR = {Erk, Katrin and Niehren, Joachim}, TITLE = {Well-Nested Parallelism Constraints for Ellipsis Resolution}, YEAR = {2003}, BOOKTITLE = {Proceedings of EACL'03}, ADDRESS = {Budapest}, URL = {http://www.ps.uni-sb.de/Papers/abstracts/wellnested.html} } @InProceedings{Erk_Pado:2004, AUTHOR = {Erk, Katrin and Pado, Sebastian}, TITLE = {A powerful and versatile XML Format for representing role-semantic annotation}, YEAR = {2004}, BOOKTITLE = {Proceedings of LREC-2004}, ADDRESS = {Lisbon}, URL = {https://www.coli.uni-saarland.de/~pado/pub/lrec04/salsatiger.pdf} } @InProceedings{Frank_Erk:2004, AUTHOR = {Frank, Anette and Erk, Katrin}, TITLE = {Towards an LFG Syntax-Semantics Interface for Frame Semantics Annotation}, YEAR = {2004}, BOOKTITLE = {Fifth International Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2004)}, URL = {Frank:2004:TLS} } @InProceedings{Heid_et_al:2004, AUTHOR = {Heid, Ulrich and Voormann, Holger and Milde, Jan-Torsten and Gut, Ulrike and Erk, Katrin and Pado, Sebastian}, TITLE = {Querying both time-aligned and hierarchical corpora with NXT search}, YEAR = {2004}, BOOKTITLE = {Proceedings of LREC-2004}, ADDRESS = {Lisbon}, URL = {https://www.coli.uni-saarland.de/~pado/pub/lrec04/lrec04nxtsearch.pdf} } @InProceedings{Erk_et_al:2003_5, AUTHOR = {Erk, Katrin and Kowalski, Andrea and Pado, Sebastian}, TITLE = {The SALSA Annotation Tool}, YEAR = {2003}, BOOKTITLE = {Proceedings of the Workshop on Prospects and Advances in the Syntax/Semantics Interface}, EDITOR = {Duchier, Denys and Kruijff, Geert-Jan M.}, ADDRESS = {Nancy, France}, URL = {https://www.coli.uni-saarland.de/~erk/OnlinePapers/lorrainesaarland.ps} } @InProceedings{Heid_et_al:2004_1, AUTHOR = {Heid, Ulrich and Voormann, Holger and Milde, Jan-Torsten and Gut, Ulrike and Erk, Katrin and Pado, Sebastian}, TITLE = {Querying both time-aligned and hierarchical corpora with NXT search}, YEAR = {2004}, BOOKTITLE = {Proceedings of LREC-2004}, ADDRESS = {Lisbon, Portugal}, URL = {Heid:2004:QBTb} } @InProceedings{erkpado2005, AUTHOR = {Erk, Katrin and Pado, Sebastian}, TITLE = {Analysing models for semantic role assignment using confusability}, YEAR = {2005}, BOOKTITLE = {Proceedings of HLT/EMNLP 2005}, ADDRESS = {Vancouver, BC} } @InProceedings{padoerk2005, AUTHOR = {Pado, Sebastian and Erk, Katrin}, TITLE = {To cause or not to cause: Cross-lingual semantic matching for paraphrasemodelling}, YEAR = {2005}, BOOKTITLE = {Proceedings of the Cross-Language Knowledge Induction Workshop}, ADDRESS = {Cluj-Napoca, Romania} } @InProceedings{burchardterk2005, AUTHOR = {Burchardt, Aljoscha and Erk, Katrin and Frank, Anette}, TITLE = {A WordNet Detour to FrameNet}, YEAR = {2005}, BOOKTITLE = {Sprachtechnologie, mobile Kommunikation und linguistische Resourcen}, VOLUME = {8}, EDITOR = {Fisseni, Bernhard and Schmitz, Hans-Christian and Schröder, Bernhard}, SERIES = {Computer Studies in Language and Speech}, PUBLISHER = {Peter Lang, Frankfurt am Main} } @InProceedings{erk2005, AUTHOR = {Erk, Katrin}, TITLE = {Frame assignment as word sense disambiguation}, YEAR = {2005}, BOOKTITLE = {Proceedings of IWCS-6}, ADDRESS = {Tilburg, The Netherlands} } @InProceedings{schulte2005, AUTHOR = {Schulte im Walde, Sabine and Erk, Katrin}, TITLE = {A comparison of German semantic verb classifications}, YEAR = {2005}, BOOKTITLE = {Proceedings of IWCS-6}, ADDRESS = {Tilburg, The Netherlands} } @InProceedings{EP2006, AUTHOR = {Erk, Katrin and Pado, Sebastian}, TITLE = {Shalmaneser - a flexible toolbox for semantic role assignment}, YEAR = {2006}, BOOKTITLE = {Proceedings of LREC 2006: the 5 th International Conference on Language Resources and Evaluation, Genoa, Italy. - Paris} } @InProceedings{BEFP2006, AUTHOR = {Burchardt, Aljoscha and Erk, Katrin and Frank, Anette and Pado, Sebastian}, TITLE = {SALTO - a versatile multi-level annotation tool}, YEAR = {2006}, BOOKTITLE = {roceedings of LREC 2006 : the 5 th International Conference on Language Resources and Evaluation, Genoa, Italy. - Paris}, PAGES = {517-520} } @InProceedings{BEP2006, AUTHOR = {Burchardt, Aljoscha and Erk, Katrin and Pado, Sebastian}, TITLE = {Challenges in lexical semantics : non-compositionality in SALSA corpus annotation}, YEAR = {2006}, MONTH = {22-24 February}, BOOKTITLE = {Abstracts zu den Vorträgen/28. Jahrestagung der Dutschen Gesellschaft für Sprachwissenschaft (DGfS): Universität Bielefeld}, PAGES = {192}, ADDRESS = {Bielefeld} } @InProceedings{BEPat2006, AUTHOR = {Burchardt, Aljoscha and Erk, Katrin and Pado, Sebastian}, TITLE = {Consistency and coverage: challenges for exhaustive semantic annotation}, YEAR = {2006}, BOOKTITLE = {Referate/28. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft (DGfS)}, ADDRESS = {Bielefeld}, ORGANIZATION = {DGfS} } @Proceedings{filpink2004, TITLE = {Building lexical resources from semmantically annotated corpora: Proceedings of a workshop held at LREC}, YEAR = {2004}, EDITOR = {Fillmore, C. and Pinkal, Manfred and Baker, Collin and Erk, Katrin}, ADDRESS = {LIsbon}, ORGANIZATION = {LREC} } @InCollection{BuErFrKoPaPi2009, AUTHOR = {Burchardt, Aljoscha and Erk, Katrin and Frank, Anette and Kowalski, Andrea and Pado, Sebastian and Pinkal, Manfred}, TITLE = {Using FrameNet for the semantic analysis of German : annotation, representation and automation}, YEAR = {2009}, BOOKTITLE = { FrameNets in computational lexicography : methods and applications}, VOLUME = {200}, PAGES = {209-244}, EDITOR = {Boas, Hans C.}, SERIES = {Trends in linguistics / Studies and monographs}, ADDRESS = {Berlin [u.a.]}, PUBLISHER = {de Gruyter}, NOTE = {MP} }