Collocation Classification with Unsupervised Relation Vectors

Luis Espinosa Anke, Steven Schockaert, Leo Wanner


Abstract
Lexical relation classification is the task of predicting whether a certain relation holds between a given pair of words. In this paper, we explore to which extent the current distributional landscape based on word embeddings provides a suitable basis for classification of collocations, i.e., pairs of words between which idiosyncratic lexical relations hold. First, we introduce a novel dataset with collocations categorized according to lexical functions. Second, we conduct experiments on a subset of this benchmark, comparing it in particular to the well known DiffVec dataset. In these experiments, in addition to simple word vector arithmetic operations, we also investigate the role of unsupervised relation vectors as a complementary input. While these relation vectors indeed help, we also show that lexical function classification poses a greater challenge than the syntactic and semantic relations that are typically used for benchmarks in the literature.
Anthology ID:
P19-1576
Volume:
Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics
Month:
July
Year:
2019
Address:
Florence, Italy
Editors:
Anna Korhonen, David Traum, Lluís Màrquez
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
5765–5772
Language:
URL:
https://aclanthology.org/P19-1576
DOI:
10.18653/v1/P19-1576
Bibkey:
Cite (ACL):
Luis Espinosa Anke, Steven Schockaert, and Leo Wanner. 2019. Collocation Classification with Unsupervised Relation Vectors. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 5765–5772, Florence, Italy. Association for Computational Linguistics.
Cite (Informal):
Collocation Classification with Unsupervised Relation Vectors (Espinosa Anke et al., ACL 2019)
Copy Citation:
PDF:
https://aclanthology.org/P19-1576.pdf
Video:
 https://aclanthology.org/P19-1576.mp4
Code
 luisespinosa/lexfunc