Javascript must be enabled to continue!
A proof-of-concept meaning discrimination experiment to compile a word-in-context dataset for adjectives – A graph-based distributional approach
View through CrossRef
AbstractThe Word-in-Context corpus, which forms part of the SuperGLUE benchmark dataset, focuses on a specific sense disambiguation task: it has to be decided whether two occurrences of a given target word in two different contexts convey the same meaning or not. Unfortunately, the WiC database exhibits a relatively low consistency in terms of inter-annotator agreement, which implies that the meaning discrimination task is not well defined even for humans. The present paper aims at tackling this problem through anchoring semantic information to observable surface data. For doing so, we have experimented with a graph-based distributional approach, where both sparse and dense adjectival vector representations served as input. According to our expectations the algorithm is able to anchor the semantic information to contextual data, and therefore it is able to provide clear and explicit criteria as to when the same meaning should be assigned to the occurrences. Moreover, since this method does not rely on any external knowledge base, it should be suitable for any low- or medium-resourced language.
Title: A proof-of-concept meaning discrimination experiment to compile a word-in-context dataset for adjectives – A graph-based distributional approach
Description:
AbstractThe Word-in-Context corpus, which forms part of the SuperGLUE benchmark dataset, focuses on a specific sense disambiguation task: it has to be decided whether two occurrences of a given target word in two different contexts convey the same meaning or not.
Unfortunately, the WiC database exhibits a relatively low consistency in terms of inter-annotator agreement, which implies that the meaning discrimination task is not well defined even for humans.
The present paper aims at tackling this problem through anchoring semantic information to observable surface data.
For doing so, we have experimented with a graph-based distributional approach, where both sparse and dense adjectival vector representations served as input.
According to our expectations the algorithm is able to anchor the semantic information to contextual data, and therefore it is able to provide clear and explicit criteria as to when the same meaning should be assigned to the occurrences.
Moreover, since this method does not rely on any external knowledge base, it should be suitable for any low- or medium-resourced language.
Related Results
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Burning, edge burning & chromatic burning classification of some graph family
Burning, edge burning & chromatic burning classification of some graph family
Graph ‘G’ is a Simple and undirected graph, which has a lowest number of color that is required to color the edge is called chromatic index. It is denoted by the symbol χ1(G). In ...
Introduction to the Tafel v-bis Dataset: Death Duty Summary Information for The Netherlands, 1921
Introduction to the Tafel v-bis Dataset: Death Duty Summary Information for The Netherlands, 1921
Abstract
This article introduces a newly constructed dataset (i.e. the Tafel v-bis Dataset) containing summary information for all Dutch citizens who died in 1921 and were subject ...
"You kind of have to listen to me": researching discrimination through poetry
"You kind of have to listen to me": researching discrimination through poetry
Arts-based research approaches, such as poetic inquiry and autoethnography, are attracting interest for their ability to engage wide-ranging audiences with creative, emotive, and t...
Verbal Attributes of Simultaneous Wind Instrument Timbres: II. Adjectives Induced from Piston's "Orchestration"
Verbal Attributes of Simultaneous Wind Instrument Timbres: II. Adjectives Induced from Piston's "Orchestration"
Experiments were conducted to explore the relationship between wind instrument dyad timbres and verbal attributes drawn from the musicological literature in order to compare and co...
Query driven-graph neural networks for community search
Query driven-graph neural networks for community search
Given one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices. Attributed Community ...
Every Word is a Name: Autonymy and Quotation in Augustine
Every Word is a Name: Autonymy and Quotation in Augustine
AbstractAugustine famously claims every word is a name. Some readers take Augustine to thereby maintain a purely referentialist semantic account according to which every word is a ...
Divergent semantic integration (DSI): Extracting creativity from narratives with distributional semantic modeling
Divergent semantic integration (DSI): Extracting creativity from narratives with distributional semantic modeling
AbstractWe developed a novel conceptualization of one component of creativity in narratives by integrating creativity theory and distributional semantics theory. We termed the new ...