Unsupervised Mining of Analogical Frames by Constraint Satisfaction

Lance De Vine, Shlomo Geva, Peter Bruza


Abstract
It has been demonstrated that vector-based representations of words trained on large text corpora encode linguistic regularities that may be exploited via the use of vector space arithmetic. This capability has been extensively explored and is generally measured via tasks which involve the automated completion of linguistic proportional analogies. The question remains, however, as to what extent it is possible to induce relations from word embeddings in a principled and systematic way, without the provision of exemplars or seed terms. In this paper we propose an extensible and efficient framework for inducing relations via the use of constraint satisfaction. The method is efficient, unsupervised and can be customized in various ways. We provide both quantitative and qualitative analysis of the results.
Anthology ID:
U18-1004
Volume:
Proceedings of the Australasian Language Technology Association Workshop 2018
Month:
December
Year:
2018
Address:
Dunedin, New Zealand
Editors:
Sunghwan Mac Kim, Xiuzhen (Jenny) Zhang
Venue:
ALTA
SIG:
Publisher:
Note:
Pages:
34–43
Language:
URL:
https://aclanthology.org/U18-1004
DOI:
Bibkey:
Cite (ACL):
Lance De Vine, Shlomo Geva, and Peter Bruza. 2018. Unsupervised Mining of Analogical Frames by Constraint Satisfaction. In Proceedings of the Australasian Language Technology Association Workshop 2018, pages 34–43, Dunedin, New Zealand.
Cite (Informal):
Unsupervised Mining of Analogical Frames by Constraint Satisfaction (De Vine et al., ALTA 2018)
Copy Citation:
PDF:
https://aclanthology.org/U18-1004.pdf
Code
 ldevine/AFM