@inproceedings{wartena-aga-2016-cogalex,
title = "{C}og{AL}ex-{V} Shared Task: {H}s{H}-Supervised {--} Supervised similarity learning using entry wise product of context vectors",
author = "Wartena, Christian and
Aga, Rosa Tsegaye",
editor = "Zock, Michael and
Lenci, Alessandro and
Evert, Stefan",
booktitle = "Proceedings of the 5th Workshop on Cognitive Aspects of the Lexicon ({C}og{AL}ex - V)",
month = dec,
year = "2016",
address = "Osaka, Japan",
publisher = "The COLING 2016 Organizing Committee",
url = "https://aclanthology.org/W16-5316",
pages = "114--118",
abstract = "The CogALex-V Shared Task provides two datasets that consists of pairs of words along with a classification of their semantic relation. The dataset for the first task distinguishes only between related and unrelated, while the second data set distinguishes several types of semantic relations. A number of recent papers propose to construct a feature vector that represents a pair of words by applying a pairwise simple operation to all elements of the feature vector. Subsequently, the pairs can be classified by training any classification algorithm on these vectors. In the present paper we apply this method to the provided datasets. We see that the results are not better than from the given simple baseline. We conclude that the results of the investigated method are strongly depended on the type of data to which it is applied.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="wartena-aga-2016-cogalex">
<titleInfo>
<title>CogALex-V Shared Task: HsH-Supervised – Supervised similarity learning using entry wise product of context vectors</title>
</titleInfo>
<name type="personal">
<namePart type="given">Christian</namePart>
<namePart type="family">Wartena</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Rosa</namePart>
<namePart type="given">Tsegaye</namePart>
<namePart type="family">Aga</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2016-12</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 5th Workshop on Cognitive Aspects of the Lexicon (CogALex - V)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Michael</namePart>
<namePart type="family">Zock</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Alessandro</namePart>
<namePart type="family">Lenci</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Stefan</namePart>
<namePart type="family">Evert</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>The COLING 2016 Organizing Committee</publisher>
<place>
<placeTerm type="text">Osaka, Japan</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>The CogALex-V Shared Task provides two datasets that consists of pairs of words along with a classification of their semantic relation. The dataset for the first task distinguishes only between related and unrelated, while the second data set distinguishes several types of semantic relations. A number of recent papers propose to construct a feature vector that represents a pair of words by applying a pairwise simple operation to all elements of the feature vector. Subsequently, the pairs can be classified by training any classification algorithm on these vectors. In the present paper we apply this method to the provided datasets. We see that the results are not better than from the given simple baseline. We conclude that the results of the investigated method are strongly depended on the type of data to which it is applied.</abstract>
<identifier type="citekey">wartena-aga-2016-cogalex</identifier>
<location>
<url>https://aclanthology.org/W16-5316</url>
</location>
<part>
<date>2016-12</date>
<extent unit="page">
<start>114</start>
<end>118</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T CogALex-V Shared Task: HsH-Supervised – Supervised similarity learning using entry wise product of context vectors
%A Wartena, Christian
%A Aga, Rosa Tsegaye
%Y Zock, Michael
%Y Lenci, Alessandro
%Y Evert, Stefan
%S Proceedings of the 5th Workshop on Cognitive Aspects of the Lexicon (CogALex - V)
%D 2016
%8 December
%I The COLING 2016 Organizing Committee
%C Osaka, Japan
%F wartena-aga-2016-cogalex
%X The CogALex-V Shared Task provides two datasets that consists of pairs of words along with a classification of their semantic relation. The dataset for the first task distinguishes only between related and unrelated, while the second data set distinguishes several types of semantic relations. A number of recent papers propose to construct a feature vector that represents a pair of words by applying a pairwise simple operation to all elements of the feature vector. Subsequently, the pairs can be classified by training any classification algorithm on these vectors. In the present paper we apply this method to the provided datasets. We see that the results are not better than from the given simple baseline. We conclude that the results of the investigated method are strongly depended on the type of data to which it is applied.
%U https://aclanthology.org/W16-5316
%P 114-118
Markdown (Informal)
[CogALex-V Shared Task: HsH-Supervised – Supervised similarity learning using entry wise product of context vectors](https://aclanthology.org/W16-5316) (Wartena & Aga, CogALex 2016)
ACL