Name
Abstract | ||
|---|---|---|
Binary relation extraction methods have been widely studied in recent years. However, few methods have been developed for higher n-ary relation extraction. One limiting factor is the effort required to generate training data. For binary relations, one only has to provide a few dozen pairs of entities per relation, as training data. For ternary relations (n=3), each training instance is a triplet of entities, placing a greater cognitive load on people. For example, many people know that Google acquired Youtube but not the dollar amount or the date of the acquisition and many people know that Hillary Clinton is married to Bill Clinton by not the location or date of their wedding. This makes higher n-nary training data generation a time consuming exercise in searching the Web. We present a resource for training ternary relation extractors. This was generated using a minimally supervised yet effective approach. We present statistics on the size and the quality of the dataset. |
Year | Venue | Field |
|---|---|---|
2015 | arXiv: Computation and Language | Training set,Computer science,Ternary relation,Bootstrapping,Binary relation,Artificial intelligence,Cognitive load,Machine learning,Relationship extraction |
DocType | Volume | Citations |
Journal | abs/1511.08952 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ndapandula Nakashole | 1 | 394 | 19.48 |