@inproceedings{baric2026_115586,
  title = {Actor Identification in Discourse : A Challenge for LLMs?},
  author = {Barić,  Ana and Padó, Sebastian and Papay, Sean},
  year = {2026},
  pages = {64–70},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115586x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115586},
  language = {eng},
  abstract = {The identification of political actors who put forward claims in public debate is a crucial step in the construction of discourse networks, which are helpful to analyze societal debates. Actor identification is, however, rather challenging: Often, the locally mentioned speaker of a claim is only a pronoun (“He proposed that [claim]”), so recovering the canonical actor name requires discourse understanding. We compare a traditional pipeline of dedicated NLP components (similar to those applied to the related task of coreference) with a LLM, which appears a good match for this generation task. Evaluating on a corpus of German actors in newspaper reports, we find surprisingly that the LLM performs worse. Further analysis reveals that the LLM is very good at identifying the right reference, but struggles to generate the correct canonical form. This points to an underlying issue in LLMs with controlling generated output. Indeed, a hybrid model combining the LLM with a classifier to normalize its output substantially outperforms both initial models.},
  keywords = {Actor Identification}
}

@inproceedings{ceron2026_115585,
  title = {Automatic Analysis of Political Debates and Manifestos : Successes and Challenges},
  author = {Ceron, Tanise and Barić,  Ana and Blessing, André and Haunss, Sebastian and Kuhn, Jonas and Lapesa, Gabriella and Padó, Sebastian and Papay, Sean and Zauchner, Patricia F.},
  year = {2026},
  pages = {71–88},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115585x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115585},
  language = {eng},
  abstract = {The opinions of political actors (e.g., politicians, parties, organizations) expressed through claims are the core elements of political debates and decision-making. Political actors communicate through different channels: parties publish manifestos for major elections, while individual actors make statements on a day-to-day basis as reflected in the media. These two channels offer different approaches for analysis: Manifestos, on the one hand, are useful to characterize the parties’ positions at a global ideological level over time. In contrast, individual statements can be collected to analyze debates in particular policy domains on a fine-grained level, in terms of individual actors and claims. In this article, we summarize a series of studies we have carried out. We apply NLP-driven (semi-)automatic analyses on these two channels and compare their potentials and challenges. The fine-grained analysis yields rich insights into the communication but comes at the cost of three challenges: (a) a substantial hunger for manual annotation, introducing practical hurdles for analysis both within and across languages; (b) difficulties in claim classification arising from the uneven frequency distribution over the theory-based annotation schemas; (c) the need to map actor mentions onto canonical versions. Manifesto-based analysis avoids these challenges to a substantial extent when a more coarse-grained analysis of party positions is sufficient. We highlight the benefits and challenges of both approaches, and conclude by outlining perspectives for addressing the challenges in future research.},
  keywords = {Claim identification, discourse network analysis, party positioning, argument mining}
}

@inproceedings{rauf2026_115584,
  title = {Medical Summarization in Practice : Design, Deployment, and Analysis of a Clinical Summarization System for a German Hospital},
  author = {Rauf, Moiz and Papay, Sean},
  year = {2026},
  pages = {455-466},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115584x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115584},
  language = {eng},
  abstract = {Through the course of hospital treatment, a large number of electronic health records (EHRs) are created for a patient, detailingaspects of care history such as lab results, physician notes, and treatments administered.At the conclusion of treatment, this collection of EHRs must be summarized into a discharge summary,describing the course or care clearly and cohesively.In this paper, we present the design and development of a clinical summarization system integrated into a live German hospital workflowto help with the generation of discharge summaries.We first describe the system, its components, and its context of use within a hospital,before performing a number of experiments to gain insights into how best to use and evaluate our system.We investigate summarization performance across multiple input encoding strategies, compare expert judgments against automatic evaluation of summaries,and analyze the consistency of model summaries across multiple text generations.This work not only acts as a case study to demonstrate the feasibility of LLM integration into healthcare infrastructure,but also provides actionable insights into the use and evaluation of such systems.},
  keywords = {Clinical Summarization System}
}

@inproceedings{rauf2026_115295,
  title = {Medical Summarization in Practice : Design, Deployment, and Analysis of a Clinical Summarization System for a German Hospital},
  author = {Rauf, Moiz and Papay, Sean},
  year = {2026},
  booktitle = {Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics},
  pages = {455–466},
  publisher = {Association for Computational Linguistics},
  isbn = {979-8-89176-384-5},
  doi = {10.18653/v1/2026.eacl-industry.34},
  url = {https://fis.uni-bamberg.de/handle/uniba/115295},
  language = {eng},
  abstract = {Through the course of hospital treatment, a large number of electronic health records (EHRs) are created for a patient, detailingaspects of care history such as lab results, physician notes, and treatments administered.At the conclusion of treatment, this collection of EHRs must be summarized into a discharge summary,describing the course or care clearly and cohesively.In this paper, we present the design and development of a clinical summarization system integrated into a live German hospital workflowto help with the generation of discharge summaries.We first describe the system, its components, and its context of use within a hospital,before performing a number of experiments to gain insights into how best to use and evaluate our system.We investigate summarization performance across multiple input encoding strategies, compare expert judgments against automatic evaluation of summaries,and analyze the consistency of model summaries across multiple text generations.This work not only acts as a case study to demonstrate the feasibility of LLM integration into healthcare infrastructure,but also provides actionable insights into the use and evaluation of such systems.},
  keywords = {Clinical Summarization System}
}

@inproceedings{nikolaev2026_115245,
  title = {Strategies for political-statement segmentation and labelling in unstructured text},
  author = {Nikolaev, Dmitry and Papay, Sean},
  year = {2026},
  booktitle = {Proceedings of the 5th International Conference on Natural Language Processing for Digital Humanities},
  pages = {437–451},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115245x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115245},
  language = {eng},
  abstract = {Analysis of parliamentary speeches and political-party manifestos has become an integral area of computational study of political texts. While speeches have been overwhelmingly analysed using unsupervised methods, a large corpus of manifestos with by-statement political-stance labels has been created by the participants of the MARPOR project. It has been recently shown that these labels can be predicted by a neural model; however, the current approach relies on provided statement boundaries, limiting out-of-domain applicability. In this work, we propose and test a range of unified split-and-label frameworks—based on linear-chain CRFs, fine-tuned text-to-text models, and the combination of in-context learning with constrained decoding—that can be used to jointly segment and classify statements from raw textual data. We show that our approaches achieve competitive accuracy when applied to raw text of political manifestos, and then demonstrate the research potential of our method by applying it to the records of the UK House of Commons and tracing the political trajectories of four major parties in the last three decades.},
  keywords = {manifesto, corpus, annotation}
}

@inproceedings{schafer2026_114413,
  title = {Which Demographics do LLMs Default to During Annotation?},
  author = {Schäfer, Johannes and Combs, Aidan and Bagdon, Christopher Doyle and Li, Jiahui and Probol, Nadine and Greschner, Lynn and Papay, Sean and Menchaca Resendiz, Yarik and Velutharambath, Aswathy and Wuehrl, Amelie and Weber, Sabine and Klinger, Roman},
  year = {2026},
  pages = {17331–17348},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114413x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114413},
  language = {eng},
  abstract = {Demographics and cultural background of annotators influence the labels they assign in text annotation – for instance, an elderly woman might find it offensive to read a message addressed to a “bro”, but a male teenager might find it appropriate. It is therefore important to acknowledge label variations to not underrepresent members of a society. Two research directions developed out of this observation in the context of using large language models (LLM) for data annotations, namely (1) studying biases and inherent knowledge of LLMs and (2) injecting diversity in the output by manipulating the prompt with demographic information. We combine these two strands of research and ask the question to which demographics an LLM resorts when no demographics is given. To answer this question, we evaluate which attributes of human annotators LLMs inherently mimic. Furthermore, we compare non-demographic conditioned prompts and placebo-conditioned prompts (e.g., “you are an annotator who lives in house number 5”) to demographics-conditioned prompts (“You are a 45 year old man and an expert on politeness annotation. How do you rate \{instance\}”). We study these questions for politeness and offensiveness annotations on the POPQUORN data set, a corpus created in a controlled manner to investigate human label variations based on demographics which has not been used for LLM-based analyses so far. We observe notable influences related to gender, race, and age in demographic prompting, which contrasts with previous studies that found no such effects},
  keywords = {-}
}

@inproceedings{papay2026_114408,
  title = {Regular-pattern-sensitive CRFs for Distant Label Interactions},
  author = {Papay, Sean and Klinger, Roman and Padó, Sebastian},
  year = {2026},
  pages = {26–35},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114408x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114408},
  language = {eng},
  abstract = {While LLMs have grown popular in sequence labeling, linear-chain conditional random fields (CRFs) remain a popular alternative with the ability to directly model interactions between labels. However, the Markov assumption limits them to interactions between adjacent labels. Weighted finite state transducers (FSTs), in contrast, can model distant label–label interactions, but exact label inference is intractable in general. In this work, we present regular-pattern-sensitive CRFs (RPCRFs), a method of enriching standard linear-chain CRFs with the ability to learn long-distance label interactions through userspecified patterns. This approach allows users to write regular-expression label patterns concisely specifying which types of interactions the model should take into account, allowing the model to learn from data whether and in which contexts these patterns occur. The result can be interpreted alternatively as a CRF augmented with additional, non-local potentials, or as a finite-state transducer whose structure is defined by a set of easily-interpretable patterns. Critically, exact training and inference are tractable for many pattern sets. We detail how an RPCRF can be automatically constructed from a set of user-specified patterns, and demonstrate the model’s effectiveness on a sequence of three synthetic sequence modeling datasets.},
  keywords = {-}
}

@inproceedings{li2026_113162,
  title = {Are Humans as Brittle as Large Language Models?},
  author = {Li, Jiahui and Papay, Sean and Klinger, Roman},
  year = {2026},
  pages = {2130–2155},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-113162x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113162},
  language = {eng},
  abstract = {The output of large language models (LLMs) is unstable, due both to non-determinism of the decoding process as well as to prompt brittleness. While the intrinsic non-determinism of LLM generation may mimic existing uncertainty in human annotations through distributional shifts in outputs, it is largely assumed, yet unexplored, that the prompt brittleness effect is unique to LLMs. This raises the question: do human annotators show similar sensitivity to prompt changes? If so, should prompt brittleness in LLMs be considered problematic? One may alternatively hypothesize that prompt brittleness correctly reflects human annotation variances. To fill this research gap, we systematically compare the effects of prompt modifications on LLMs and identical instruction modifications for human annotators, focusing on the question of whether humans are similarly sensitive to prompt perturbations. To study this, we prompt both humans and LLMs for a set of text classification tasks conditioned on prompt variations. Our findings indicate that both humans and LLMs exhibit increased brittleness in response to specific types of prompt modifications, particularly those involving the substitution of alternative label sets or label formats. However, the distribution of human judgments is less affected by typographical errors and reversed label order than that of LLMs.},
  keywords = {Large Language Model}
}

@inproceedings{li2025_112676,
  title = {Are Humans as Brittle as Large Language Models?},
  author = {Li, Jiahui and Papay, Sean and Klinger, Roman},
  year = {2025},
  booktitle = {Proceedings of the 14th International Joint Conference on Natural Language Processing and the 4th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics},
  pages = {2130–2155},
  publisher = {The Asian Federation of Natural Language Processing and The Association for Computational Linguistics},
  address = {Mumbai, India},
  isbn = {979-8-89176-298-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/112676},
  language = {eng},
  abstract = {The output of large language models (LLMs) is unstable, due both to non-determinism of the decoding process as well as to prompt brittleness. While the intrinsic non-determinism of LLM generation may mimic existing uncertainty in human annotations through distributional shifts in outputs, it is largely assumed, yet unexplored, that the prompt brittleness effect is unique to LLMs. This raises the question: do human annotators show similar sensitivity to prompt changes? If so, should prompt brittleness in LLMs be considered problematic? One may alternatively hypothesize that prompt brittleness correctly reflects human annotation variances. To fill this research gap, we systematically compare the effects of prompt modifications on LLMs and identical instruction modifications for human annotators, focusing on the question of whether humans are similarly sensitive to prompt perturbations. To study this, we prompt both humans and LLMs for a set of text classification tasks conditioned on prompt variations. Our findings indicate that both humans and LLMs exhibit increased brittleness in response to specific types of prompt modifications, particularly those involving the substitution of alternative label sets or label formats. However, the distribution of human judgments is less affected by typographical errors and reversed label order than that of LLMs.},
  keywords = {Large Language Model}
}

@inproceedings{papay2025_108319,
  title = {Dissecting Span Identification Tasks with Performance Prediction},
  author = {Papay, Sean and Klinger, Roman and Padó, Sebastian},
  year = {2025},
  pages = {4881-4895},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1083197},
  url = {https://fis.uni-bamberg.de/handle/uniba/108319},
  language = {eng},
  abstract = {Span identification (in short, span ID) tasks such as chunking, NER, or code-switching detection, ask models to identify and classify relevant spans in a text. Despite being a staple of NLP, and sharing a common structure, there is little insight on how these tasks’ properties influence their difficulty, and thus little guidance on what model families work well on span ID tasks, and why. We analyze span ID tasks via performance prediction, estimating how well neural architectures do on different tasks. Our contributions are: (a) we identify key properties of span ID tasks that can inform performance prediction; (b) we carry out a large-scale experiment on English data, building a model to predict performance for unseen span ID tasks that can support architecture choices; (c), we investigate the parameters of the meta model, yielding new insights on how model and task properties interact to affect span ID performance. We find, e.g., that span frequency is especially important for LSTMs, and that CRFs help when spans are infrequent and boundaries non-distinctive.},
  keywords = {Span Identification Tasks}
}

@inproceedings{schafer2025_109541,
  title = {Which Demographics do LLMs Default to During Annotation?},
  author = {Schäfer, Johannes and Combs, Aidan and Bagdon, Christopher Doyle and Li, Jiahui and Probol, Nadine and Greschner, Lynn and Papay, Sean and Menchaca Resendiz, Yarik and Velutharambath, Aswathy and Wuehrl, Amelie and Weber, Sabine and Klinger, Roman},
  year = {2025},
  booktitle = {Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics},
  pages = {17331–17348},
  publisher = {Association for Computational Linguistics},
  isbn = {979-8-89176-251-0},
  doi = {10.18653/v1/2025.acl-long.848},
  url = {https://fis.uni-bamberg.de/handle/uniba/109541},
  language = {eng},
  abstract = {Demographics and cultural background of annotators influence the labels they assign in text annotation – for instance, an elderly woman might find it offensive to read a message addressed to a “bro”, but a male teenager might find it appropriate. It is therefore important to acknowledge label variations to not underrepresent members of a society. Two research directions developed out of this observation in the context of using large language models (LLM) for data annotations, namely (1) studying biases and inherent knowledge of LLMs and (2) injecting diversity in the output by manipulating the prompt with demographic information. We combine these two strands of research and ask the question to which demographics an LLM resorts when no demographics is given. To answer this question, we evaluate which attributes of human annotators LLMs inherently mimic. Furthermore, we compare non-demographic conditioned prompts and placebo-conditioned prompts (e.g., “you are an annotator who lives in house number 5”) to demographics-conditioned prompts (“You are a 45 year old man and an expert on politeness annotation. How do you rate \{instance\}”). We study these questions for politeness and offensiveness annotations on the POPQUORN data set, a corpus created in a controlled manner to investigate human label variations based on demographics which has not been used for LLM-based analyses so far. We observe notable influences related to gender, race, and age in demographic prompting, which contrasts with previous studies that found no such effects},
  keywords = {-}
}

@inproceedings{papay2025_109547,
  title = {Regular-pattern-sensitive CRFs for Distant Label Interactions},
  author = {Papay, Sean and Klinger, Roman and Padó, Sebastian},
  year = {2025},
  booktitle = {Proceedings of the 1st Joint Workshop on Large Language Models and Structure Modeling (XLLM 2025)},
  pages = {26–35},
  publisher = {Association for Computational Linguistics},
  isbn = {979-8-89176-286-2},
  doi = {10.18653/v1/2025.xllm-1.4},
  url = {https://fis.uni-bamberg.de/handle/uniba/109547},
  language = {eng},
  abstract = {While LLMs have grown popular in sequence labeling, linear-chain conditional random fields (CRFs) remain a popular alternative with the ability to directly model interactions between labels. However, the Markov assumption limits them to interactions between adjacent labels. Weighted finite state transducers (FSTs), in contrast, can model distant label–label interactions, but exact label inference is intractable in general. In this work, we present regular-pattern-sensitive CRFs (RPCRFs), a method of enriching standard linear-chain CRFs with the ability to learn long-distance label interactions through userspecified patterns. This approach allows users to write regular-expression label patterns concisely specifying which types of interactions the model should take into account, allowing the model to learn from data whether and in which contexts these patterns occur. The result can be interpreted alternatively as a CRF augmented with additional, non-local potentials, or as a finite-state transducer whose structure is defined by a set of easily-interpretable patterns. Critically, exact training and inference are tractable for many pattern sets. We detail how an RPCRF can be automatically constructed from a set of user-specified patterns, and demonstrate the model’s effectiveness on a sequence of three synthetic sequence modeling datasets.},
  keywords = {-}
}

@inproceedings{adel2025_108297,
  title = {DERE : A Task and Domain-Independent Slot Filling Framework for Declarative Relation Extraction},
  author = {Adel, Heike and Bostan, Laura Ana Maria and Papay, Sean and Padó, Sebastian and Klinger, Roman},
  year = {2025},
  pages = {42–47},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1082972},
  url = {https://fis.uni-bamberg.de/handle/uniba/108297},
  language = {eng},
  abstract = {Most machine learning systems for natural language processing are tailored to specific tasks. As a result, comparability of models across tasks is missing and their applicability to new tasks is limited. This affects end users without machine learning experience as well as model developers. To address these limitations, we present DERE, a novel framework for declarative specification and compilation of template-based information extraction. It uses a generic specification language for the task and for data annotations in terms of spans and frames. This formalism enables the representation of a large variety of natural language processing challenges. The backend can be instantiated by different models, following different paradigms. The clear separation of frame specification and model backend will ease the implementation of new models and the evaluation of different models across different tasks. Furthermore, it simplifies transfer learning, joint learning across tasks and/or domains as well as the assessment of model generalizability. DERE is available as open-source software.},
  keywords = {DERE}
}

@inproceedings{nikolaev2025_108001,
  title = {Strategies for political-statement segmentation and labelling in unstructured text},
  author = {Nikolaev, Dmitry and Papay, Sean},
  year = {2025},
  booktitle = {Proceedings of the 5th International Conference on Natural Language Processing for Digital Humanities},
  pages = {437–451},
  publisher = {Association for Computational Linguistics},
  address = {Stroudsburg, PA},
  doi = {10.18653/v1/2025.nlp4dh-1.38},
  url = {https://fis.uni-bamberg.de/handle/uniba/108001},
  language = {eng},
  abstract = {Analysis of parliamentary speeches and political-party manifestos has become an integral area of computational study of political texts. While speeches have been overwhelmingly analysed using unsupervised methods, a large corpus of manifestos with by-statement political-stance labels has been created by the participants of the MARPOR project. It has been recently shown that these labels can be predicted by a neural model; however, the current approach relies on provided statement boundaries, limiting out-of-domain applicability. In this work, we propose and test a range of unified split-and-label frameworks—based on linear-chain CRFs, fine-tuned text-to-text models, and the combination of in-context learning with constrained decoding—that can be used to jointly segment and classify statements from raw textual data. We show that our approaches achieve competitive accuracy when applied to raw text of political manifestos, and then demonstrate the research potential of our method by applying it to the records of the UK House of Commons and tracing the political trajectories of four major parties in the last three decades.},
  keywords = {manifesto, corpus, annotation}
}

@phdthesis{papay2024_115309,
  title = {Task generality in relation extraction},
  author = {Papay, Sean},
  year = {2024},
  publisher = {Universitätsbibliothek der Universität Stuttgart},
  address = {Stuttgart},
  doi = {https://doi.org/10.18419/opus-14421},
  url = {https://fis.uni-bamberg.de/handle/uniba/115309},
  language = {eng},
  school = {Otto-Friedrich-Universität Bamberg}
}

@inproceedings{baric2024_115293,
  title = {Actor Identification in Discourse : A Challenge for LLMs?},
  author = {Barić,  Ana and Padó, Sebastian and Papay, Sean},
  year = {2024},
  booktitle = {Proceedings of the 5th Workshop on Computational Approaches to Discourse (CODI 2024)},
  pages = {64–70},
  publisher = {Association for Computational Linguistics},
  doi = {10.18653/v1/2024.codi-1.6},
  url = {https://fis.uni-bamberg.de/handle/uniba/115293},
  language = {eng},
  abstract = {The identification of political actors who put forward claims in public debate is a crucial step in the construction of discourse networks, which are helpful to analyze societal debates. Actor identification is, however, rather challenging: Often, the locally mentioned speaker of a claim is only a pronoun (“He proposed that [claim]”), so recovering the canonical actor name requires discourse understanding. We compare a traditional pipeline of dedicated NLP components (similar to those applied to the related task of coreference) with a LLM, which appears a good match for this generation task. Evaluating on a corpus of German actors in newspaper reports, we find surprisingly that the LLM performs worse. Further analysis reveals that the LLM is very good at identifying the right reference, but struggles to generate the correct canonical form. This points to an underlying issue in LLMs with controlling generated output. Indeed, a hybrid model combining the LLM with a classifier to normalize its output substantially outperforms both initial models.},
  keywords = {Actor Identification}
}

@inproceedings{ceron2024_115294,
  title = {Automatic Analysis of Political Debates and Manifestos : Successes and Challenges},
  author = {Ceron, Tanise and Barić,  Ana and Blessing, André and Haunss, Sebastian and Kuhn, Jonas and Lapesa, Gabriella and Padó, Sebastian and Papay, Sean and Zauchner, Patricia F.},
  year = {2024},
  booktitle = {Robust argumentation machines : first international conference, RATIO 2024, Bielefeld, Germany, June 5-7, 2024 : proceedings},
  pages = {71–88},
  publisher = {Springer Nature},
  address = {Cham, Switzerland},
  isbn = {978-3-031-63536-6},
  doi = {10.1007/978-3-031-63536-6\_5},
  url = {https://fis.uni-bamberg.de/handle/uniba/115294},
  language = {eng},
  abstract = {The opinions of political actors (e.g., politicians, parties, organizations) expressed through claims are the core elements of political debates and decision-making. Political actors communicate through different channels: parties publish manifestos for major elections, while individual actors make statements on a day-to-day basis as reflected in the media. These two channels offer different approaches for analysis: Manifestos, on the one hand, are useful to characterize the parties’ positions at a global ideological level over time. In contrast, individual statements can be collected to analyze debates in particular policy domains on a fine-grained level, in terms of individual actors and claims. In this article, we summarize a series of studies we have carried out. We apply NLP-driven (semi-)automatic analyses on these two channels and compare their potentials and challenges. The fine-grained analysis yields rich insights into the communication but comes at the cost of three challenges: (a) a substantial hunger for manual annotation, introducing practical hurdles for analysis both within and across languages; (b) difficulties in claim classification arising from the uneven frequency distribution over the theory-based annotation schemas; (c) the need to map actor mentions onto canonical versions. Manifesto-based analysis avoids these challenges to a substantial extent when a more coarse-grained analysis of party positions is sufficient. We highlight the benefits and challenges of both approaches, and conclude by outlining perspectives for addressing the challenges in future research.},
  keywords = {Claim identification, discourse network analysis, party positioning, argument mining}
}

@inproceedings{chen2024_115198,
  title = {Sentence‑Final Particle de in Mandarin as an Informativity Maximizer},
  author = {Chen, Jun and Papay, Sean},
  year = {2024},
  booktitle = {Selected Reflections in Language, Logic, and Information : ESSLLI 2019, ESSLLI 2020 and ESSLLI 2021 Student Sessions, Selected Papers},
  pages = {24–43},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-031-50627-7},
  doi = {10.1007/978-3-031-50628-4\_3},
  url = {https://fis.uni-bamberg.de/handle/uniba/115198},
  language = {eng}
}

@inproceedings{papay2022_93893,
  title = {Constraining Linear-chain CRFs to Regular Languages},
  author = {Papay, Sean and Klinger, Roman and Padó, Sebastian},
  year = {2022},
  publisher = {arxiv},
  url = {https://fis.uni-bamberg.de/handle/uniba/93893},
  language = {eng}
}

@inproceedings{papay2020_93908,
  title = {Dissecting Span Identification Tasks with Performance Prediction},
  author = {Papay, Sean and Klinger, Roman and Padó, Sebastian},
  year = {2020},
  booktitle = {Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)},
  pages = {4881-4895},
  publisher = {Association for Computational Linguistics},
  doi = {10.18653/v1/2020.emnlp-main.396},
  url = {https://fis.uni-bamberg.de/handle/uniba/93908},
  language = {eng},
  abstract = {Span identification (in short, span ID) tasks such as chunking, NER, or code-switching detection, ask models to identify and classify relevant spans in a text. Despite being a staple of NLP, and sharing a common structure, there is little insight on how these tasks’ properties influence their difficulty, and thus little guidance on what model families work well on span ID tasks, and why. We analyze span ID tasks via performance prediction, estimating how well neural architectures do on different tasks. Our contributions are: (a) we identify key properties of span ID tasks that can inform performance prediction; (b) we carry out a large-scale experiment on English data, building a model to predict performance for unseen span ID tasks that can support architecture choices; (c), we investigate the parameters of the meta model, yielding new insights on how model and task properties interact to affect span ID performance. We find, e.g., that span frequency is especially important for LSTMs, and that CRFs help when spans are infrequent and boundaries non-distinctive.},
  keywords = {Span Identification Tasks}
}

@inproceedings{adel2018_93960,
  title = {DERE : A Task and Domain-Independent Slot Filling Framework for Declarative Relation Extraction},
  author = {Adel, Heike and Papay, Sean and Klinger, Roman and Padó, Sebastian and Bostan, Laura Ana Maria},
  year = {2018},
  booktitle = {Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing : System Demonstrations},
  pages = {42–47},
  publisher = {Association for Computational Linguistics},
  doi = {10.18653/v1/D18-2008},
  url = {https://fis.uni-bamberg.de/handle/uniba/93960},
  language = {eng},
  abstract = {Most machine learning systems for natural language processing are tailored to specific tasks. As a result, comparability of models across tasks is missing and their applicability to new tasks is limited. This affects end users without machine learning experience as well as model developers. To address these limitations, we present DERE, a novel framework for declarative specification and compilation of template-based information extraction. It uses a generic specification language for the task and for data annotations in terms of spans and frames. This formalism enables the representation of a large variety of natural language processing challenges. The backend can be instantiated by different models, following different paradigms. The clear separation of frame specification and model backend will ease the implementation of new models and the evaluation of different models across different tasks. Furthermore, it simplifies transfer learning, joint learning across tasks and/or domains as well as the assessment of model generalizability. DERE is available as open-source software.},
  keywords = {DERE}
}

