Modelling Language Acquisition through Syntactico-Semantic Pattern Finding

33352

Authors

nan

Abstract

AbstractUsage-based theories of language acquisition have extensively documented the processes by which children acquire language through communicative interaction. Notably, Tomasello (2003) distinguishes two main cognitive capacities that underlie human language acquisition: intention reading and pattern finding. Intention reading is the process by which children try to continuously reconstruct the intended meaning of their interlocutors. Pattern finding refers to the process that allows them to distil linguistic schemata from multiple communicative interactions. Even though the fields of cognitive science and psycholinguistics have studied these processes in depth, no faithful computational operationalisations of these mechanisms through which children learn language exist to date. The research on which we report in this paper aims to fill part of this void by introducing a computational operationalisation of syntactico-semantic pattern finding. Concretely, we present a methodology for learning grammars based on similarities and differences in the form and meaning of linguistic observations alone. Our methodology is able to learn compositional lexical and item-based constructions of variable extent and degree of abstraction, along with a network of emergent syntactic categories. We evaluate our methodology on the CLEVR benchmark dataset and show that the methodology allows for fast, incremental and effective learning. The constructions and categorial network that result from the learning process are fully transparent and bidirectional, facilitating both language comprehension and production. Theoretically, our model provides computational evidence for the learnability of usage-based constructionist theories of language acquisition. Practically, the techniques that we present facilitate the learning of computationally tractable, usage-based construction grammars, which are applicable for natural language understanding and production tasks.

Keywords

nan

Full Content

Findings of the Association for Computational Linguistics: EACL 2023, pages 125–132 May 2-6, 2023 ©2023 Association for Computational Linguistics Data-Efficient Methods For Improving Hate Speech Detection Sumegh Roychowdhury ∗ IIT Kharagpur, India sumeghtech@gmail.com Vikram Gupta ShareChat, India vikramgupta@sharechat.co Abstract Scarcity of large-scale datasets, especially for resource-impoverished languages encouraged exploration of data-efficient methods for hate speech detection. In this work, we progress implicit and explicit hate speech detection us- ing an input-level data augmentation technique, task reformulation using entailment and cross- learning across five languages. Our proposed data augmentation technique EasyMixup, im- proves the F1 performance across languages by 0.5-9%. We also observe substantial F1 gains of 1-8% by reformulating hate speech detec- tion as Entailment-style problem. We further probe the contextual models and ob- serve that higher layers encode implicit hate while lower layers focus on explicit hate, high- lighting the importance of token-level under- standing for explicit and context-level for im- plicit hate speech detection. 1 1 Introduction Deep learning based methods (Badjatiya et al., 2017; Zhang et al., 2018; Kshirsagar et al., 2018) have shown impressive results in detecting hate speech. Transformer based models (Caselli et al., 2021; Tekiro˘glu et al., 2020; Aluru et al., 2020; Mozafari et al., 2019; Dutta et al., 2022) have fur- ther pushed the state-of-the-art by leveraging large amount of unlabeled data in a self-supervised man- ner. Various hate speech detection datasets have been contributed in textual (Gibert et al., 2018; Davidson et al., 2017; Founta et al., 2018), au- dio (Gupta et al., 2022) and visual (Gomez et al., 2020) domains. However, these algorithms are data-hungry and motivate development of algo- rithms which are data-efficient. To tackle this, we introduce an input-level data augmentation technique EasyMixup and im- prove hate speech detection in monolingual and ∗Work done during internship at ShareChat 1Code and Dataset splits - https://github.com/ Sumegh-git/data_efficient_hatedetect multilingual settings. EasyMixup is inspired by mixup based augmentation techniques which are broadly categorized into input-level mixup (Yun et al., 2019; Kim et al., 2020; Uddin et al., 2021; Walawalkar et al., 2020) and hidden-level mixup (Verma et al., 2019). EasyMixup follows the input-level paradigm and leverages a simple ob- servation that the label of a hateful instance is preserved on concatenation with a hateful or non- hateful instance. Similarly, label of a non-hateful instance does not change on concatenation with another non-hateful instance. We also study the efficacy of reformulating hate speech detection as Entailment-style prob- lem. We extend the work by (Wang et al., 2021) and perform detailed experiments under implicit, explicit and multilingual settings. We observe that monolingual entailment performs better than En- glish based entailment. This observation is intu- itive because the models are pretrained using pair of sentences from same language and monolingual entailment reflects the same settings. Majority of the existing textual datasets focus on explicit hate speech where swear, cuss, abusive words are used to express the hateful intent. In contrast, implicit hate speech employs subtle, indi- rect and contextual ways for expressing hate speech making it …

Content truncated to 500 words

Labeled Text

AbstractUsage-based theories of language acquisition have extensively documented the processes by which children acquire language through communicative interaction. Notably, Tomasello (2003) distinguishes two main cognitive capacities that underlie human language acquisition: intention reading and pattern finding. Intention reading is the process by which children try to continuously reconstruct the intended meaning of their interlocutors. Pattern finding refers to the process that allows them to distil linguistic schemata from multiple communicative interactions. Even though the fields of cognitive science and psycholinguistics have studied these processes in depth, no faithful computational operationalisations of these mechanisms through which children learn language exist to date. The research on which we report in this paper aims to fill part of this void by introducing a computational operationalisation of syntactico-semantic pattern finding. Concretely, we present a methodology for learning grammars based on similarities and differences in the form and meaning of linguistic observations alone. Our methodology is able to learn compositional lexical and item-based constructions of variable extent and degree of abstraction, along with a network of emergent syntactic categories. We evaluate our methodology on the CLEVR benchmark dataset and show that the methodology allows for fast, incremental and effective learning. The constructions and categorial network that result from the learning process are fully transparent and bidirectional, facilitating both language comprehension and production. Theoretically, our model provides computational evidence for the learnability of usage-based constructionist theories of language acquisition. Practically, the techniques that we present facilitate the learning of computationally tractable, usage-based construction grammars, which are applicable for natural language understanding and production tasks.

Publication Details

Paper ID:
33352
Year:
2023
Publication:
TIPSTER
Publication Type:
conf
DOI:
nan