SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1906.03158 · 2019

Matching the Blanks: Distributional Similarity for Relation Learning

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 14 functions out of this paper's own repositories and ran 9 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction pwc_unofficial 7 of 11
Soikonomou/albert_final_infer12 reimplementation 1 of 1
yi-han/BERT_Relation_Extraction extension 1 of 1
dfki-nlp/mtb-bert-em reimplementation 0 of 1
FunctionStatusWhere it lives
calc Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/utils.py
code served (permissive licence) · get_code("056e10dccac0c981")
convert_examples_to_relation_extraction_features Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/data_utils.py
code served (permissive licence) · get_code("4ceff0a659777901")
features2tensors Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/data_utils.py
code served (permissive licence) · get_code("6925605bcb0e4afa")
gelu Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/model_utils.py
code served (permissive licence) · get_code("4dc5e7239221c929")
load_pickle Ran Soikonomou/albert_final_infer12/src/tasks/infer.py
code served (permissive licence) · get_code("bb4b4b5ebab73228")
load_pickle Ran yi-han/BERT_Relation_Extraction/src/infer.py
pointer only (licence: NONE) · get_code("6b2f5d5a22d006f7")
measure_prf Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/utils.py
code served (permissive licence) · get_code("5df801e41d511da6")
relation_extraction_data_loader Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/data_utils.py
code served (permissive licence) · get_code("8665fb489259bdf8")
try_catch_annotator Ran uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/utils.py
code served (permissive licence) · get_code("99651d855fa20393")
get_mask Not yet run uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/model_utils.py
code served (permissive licence) · get_code("05732f1a5126672d")
json2args Not yet run uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/src/relation_extraction_json.py
code served (permissive licence) · get_code("7d1f16579e77c0fb")
nltk_tokenization_engine Not yet run uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/baseline/data_utils.py
code served (permissive licence) · get_code("f31508e399da30ed")
pkl_load Not yet run uf-hobi-informatics-lab/ClinicalTransformerRelationExtraction/baseline/data_utils.py
code served (permissive licence) · get_code("1012ce3bde482566")
train_and_eval Not yet run dfki-nlp/mtb-bert-em/src/mtb/train_eval.py
code served (permissive licence) · get_code("e50b2589e0455d1f")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

General purpose relation extractors, which can model arbitrary relations, are a core aspiration in information extraction. Efforts have been made to build general purpose extractors that represent relations with their surface forms, or which jointly embed surface forms with relations from an existing knowledge graph. However, both of these approaches are limited in their ability to generalize. In this paper, we build on extensions of Harris' distributional hypothesis to relations, as well as recent advances in learning text representations (specifically, BERT), to build task agnostic relation representations solely from entity-linked text. We show that these representations significantly outperform previous work on exemplar based relation extraction (FewRel) even without using any of that task's training data. We also show that models initialized with our task agnostic representations, and then tuned on supervised relation extraction datasets, significantly outperform the previous methods on SemEval 2010 Task 8, KBP37, and TACRED.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1906.03158")
get_code_for_paper("1906.03158")
have("1906.03158")

Connect an agent — have() is free.