| 1. |
- Wirén, Mats, 1954-, et al.
(författare)
-
Annotating the Narrative: A Plot of Scenes, Events, Characters and Other Intriguing Elements
- 2022
-
Ingår i: LIVE and LEARN. - Gothenburg : Department of Swedish, Multilingualism, Language Technology. - 9789187850837 ; , s. 161-164
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Analysis of narrative structure in prose fiction is a field which is gaining increased attention in NLP, and which potentially has many interesting and more far-reaching applications. This paper provides a summary and motivation of two different but interrelated strands of work that we have carried out in this field during the last years: on the one hand, principles and guidelines for annotation, and on the other, methods for automatic annotation.
|
|
| 2. |
- Amanaki, Erini, et al.
(författare)
-
Fine-grained Entailment: Resources for Greek NLI and Precise Entailment
- 2022
-
Ingår i: Proceedings of the Workshop on Dataset Creation for Lower-Resourced Languages within the 13th Language Resources and Evaluation Conference. - Marseille, France : European Language Resources Association (ELRA). - 9782493814067
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present a number of fine-grained resources for Natural Language Inference (NLI). In particular, we present a number of resources and validation methods for Greek NLI and a resource for precise NLI. First, we extend the Greek version of the FraCaS test suite to include examples where the inference is directly linked to the syntactic/morphological properties of Greek. The new resource contains an additional 428 examples, making it in total a dataset of 774 examples. Expert annotators have been used in order to create the additional resource, while extensive validation of the original Greek version of the FraCaS by non-expert and expert subjects is performed. Next, we continue the work initiated by (CITATION), according to which a subset of the RTE problems have been labeled for missing hypotheses and we present a dataset an order of magnitude larger, annotating the whole SuperGlUE/RTE dataset with missing hypotheses. Lastly, we provide a de-dropped version of the Greek XNLI dataset, where the pronouns that are missing due to the pro-drop nature of the language are inserted. We then run some models to see the effect of that insertion and report the results.
|
|
| 3. |
- Bernardy, Jean-Philippe, 1978, et al.
(författare)
-
Can the Transformer Learn Nested Recursion with Symbol Masking?
- 2021
-
Ingår i: Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021, August 1 - 6, 2021, Online / Chengqing Zong, Fei Xia, Wenjie Li, Roberto Navigli (Editors). - Stroudsburg, PA : The Association for Computational Linguistics. - 9781954085541
-
Konferensbidrag (refereegranskat)abstract
- We investigate if, given a simple symbol masking strategy, self-attention models are capable of learning nested structures and generalise over their depth. We do so in the simplest setting possible, namely languages consisting of nested parentheses of several kinds. We use encoder-only models, which we train to predict randomly masked symbols, in a BERT-like fashion. We find that the accuracy is well above random baseline, with accuracy consistently above 50% both when increasing nesting depth and distances between training and testing. However, we find that the predictions made correspond to a simple parenthesis counting strategy, rather than a push-down automaton. This suggests that self-attention models are not suitable for tasks which require generalisation to more complex instances of recursive structures than those found in the training set.
|
|
| 4. |
- Dobnik, Simon, 1977, et al.
(författare)
-
In Search of Meaning and Its Representations for Computational Linguistics
- 2022
-
Ingår i: Proceedings of the 2022 CLASP Conference on (Dis)embodiment, Gothenburg and online 15–16 September 2022 / Simon Dobnik, Julian Grove and Asad Sayeed (eds.). - : Association for Computational Linguistics. - 2002-9764. - 9781955917674
-
Konferensbidrag (refereegranskat)abstract
- In this paper we examine different meaning representations that are commonly used in different natural language applications today and discuss their limits, both in terms of the aspects of the natural language meaning they are modelling and in terms of the aspects of the application for which they are used.
|
|
| 5. |
|
|
| 6. |
- Ek, Adam, 1990, et al.
(författare)
-
Can argument-predicate relationships be extracted from UD trees?
- 2021
-
Ingår i: Proceedings of the Joint 15th Linguistic Annotation Workshop (LAW) and 3rd Designing Meaning Representations (DMR) Workshop, November 2021. - Punta Cana, Dominican Republic : Association for Computational Linguistics. - 9781954085855
-
Konferensbidrag (refereegranskat)abstract
- In this paper we investigate the possibility of extracting predicate-argument relations from UD trees (and enhanced UD graphs). Concretely, we apply UD parsers on an English question answering/semantic-role labeling data set (FitzGerald et al., 2018) and check if the annotations reflect the relations in the resulting parse trees, using a small number of rules to extract this information. We find that 79.1 % of the argument-predicate pairs can be found in this way, on the basis of Udify (Kondratyuk and Straka, 2019). Error analysis reveals that half of the error cases are attributable to shortcomings in the dataset. The remaining errors are mostly due to predicate-argument relations not being extractible algorithmically from the UD trees (requiring semantic reasoning to be resolved). The parser itself is only responsible for a small portion of errors. Our analysis suggests a number of improvements to the UD annotation schema: we propose to enhance the schema in four ways, in order to capture argument-predicate relations. Additionally, we propose improvements regarding data collection for question answering/semantic-role labeling data.
|
|
| 7. |
- Ek, Adam, 1990, et al.
(författare)
-
Composing Byte-Pair Encodings for Morphological Sequence Classification
- 2020
-
Ingår i: Proceedings of the Fourth Workshop on Universal Dependencies (UDW 2020), December 13, 2020, Barcelona, Spain (Online). - : Association for Computational Linguistics. - 0891-2017. - 9781952148484
-
Konferensbidrag (refereegranskat)abstract
- Byte-pair encodings is a method for splitting a word into sub-word tokens, a language model then assigns contextual representations separately to each of these tokens. In this paper, we evaluate four different methods of composing such sub-word representations into word representations. We evaluate the methods on morphological sequence classification, the task of predicting grammatical features of a word. Our experiments reveal that using an RNN to compute word representations is consistently more effective than the other methods tested across a sample of eight languages with different typology and varying numbers of byte-pair tokens per word.
|
|
| 8. |
- Ek, Adam, 1990-, et al.
(författare)
-
Distinguishing Narration and Speech in Prose Fiction Dialogues
- 2019
-
Ingår i: Proceedings of the Digital Humanities in the Nordic Countries 4th Conference. - : CEUR-WS.org. ; , s. 124-132
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a supervised method for a novel task, namely, detecting elements of narration in passages of dialogue in prose fiction. The method achieves an F1-score of 80.8%, exceeding the best baseline by almost 33 percentage points. The purpose of the method is to enable a more fine-grained analysis of fictional dialogue than has previously been possible, and to provide a component for the further analysis of narrative structure in general.
|
|
| 9. |
- Ek, Adam, 1990, et al.
(författare)
-
How does Punctuation Affect Neural Models in Natural Language Inference
- 2020
-
Ingår i: Proceedings of the Probability and Meaning Conference (PaM 2020), October 14-15, 2020, s. 109-116. - : Association for Computational Linguistics. - 0891-2017.
-
Konferensbidrag (refereegranskat)abstract
- Natural Language Inference models have reached almost human-level performance but their generalisation capabilities have not been yet fully characterized. In particular, sensitivity to small changes in the data is a current area of investigation. In this paper, we focus on the effect of punctuation on such models. Our findings can be broadly summarized as follows: (1) irrelevant changes in punctuation are correctly ignored by the recent transformer models (DistilBERT) while older RNN-based models were sensitive to them. (2) All models, both transformers and RNN-based models, are incapable of taking into account small relevant changes in the punctuation.
|
|
| 10. |
- Ek, Adam, 1990, et al.
(författare)
-
How much of enhanced UD is contained in UD?
- 2020
-
Ingår i: Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, July 9, 2020 / Gosse Bouma, Yuji Matsumoto, Stephan Oepen, Kenji Sagae, Djamé Seddah, Weiwei Sun, Anders Søgaard, Reut Tsarfaty, Dan Zeman (Editors). - Stroudsburg, PA : Association for Computational Linguistics. - 9781952148118
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present the submission of team CLASP to the IWPT 2020 Shared Task on parsing enhanced universal dependencies (Bouma, 2020). We develop a tree-to-graph transformation algorithm based on dependency patterns. This algorithm can transform gold UD trees to EUD graphs with an ELAS score of 81.55 and a EULAS score of 96.70. These results show that much of the information needed to construct EUD graphs from UD trees are present in the UD trees. Coupled with a standard UD parser, the method applies to the official test data and yields and ELAS score of 67.85 and a EULAS score is 80.18.
|
|
