Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) 2014
DOI: 10.3115/v1/p14-1098
|View full text |Cite
|
Sign up to set email alerts
|

Structured Learning for Taxonomy Induction with Belief Propagation

Abstract: We present a structured learning approach to inducing hypernym taxonomies using a probabilistic graphical model formulation. Our model incorporates heterogeneous relational evidence about both hypernymy and siblinghood, captured by semantic features based on patterns and statistics from Web n-grams and Wikipedia abstracts. For efficient inference over taxonomy structures, we use loopy belief propagation along with a directed spanning tree algorithm for the core hypernymy factor. To train the system, we extract… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
98
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(99 citation statements)
references
References 31 publications
1
98
0
Order By: Relevance
“…in Eqs. (3)(4)(5) and adjust the dimensionality of W (k −1) accordingly. Such position embeddings help us to learn better node representations from two aspects.…”
Section: Representing Anchor Conceptmentioning
confidence: 99%
“…in Eqs. (3)(4)(5) and adjust the dimensionality of W (k −1) accordingly. Such position embeddings help us to learn better node representations from two aspects.…”
Section: Representing Anchor Conceptmentioning
confidence: 99%
“…Navigli et al [25] and Velardi et al [42] use the same longest-path idea to weigh edges and then find the largestweight taxonomy as a Maximum Spanning Tree. Bansal et al [3] build a factor graph to model hypernymy relations and regard taxonomy induction as a structured learning problem, which can be inferred with loop belief propagation. Recently, Gupta et al [9] propose to build the initial graph using hypernym subsequence (instead of single hypernym pair) and model taxonomy induction as a minimum-cost flow problem [26].…”
Section: Taxonomy Constructionmentioning
confidence: 99%
“…A similar approach formulated in terms of factor graphs can be seen in (Bansal et al, 2013). Finally, (Yamada et al, 2011) employ a hybrid strategy, scoring edges by likelihood of appearance in Wikipedia.…”
Section: Related Workmentioning
confidence: 99%