๐Ÿ† #1,821 overall#59 of 158 in Information Extraction

qipeng /gcn-over-pruned-trees

Graph Convolution over Pruned Dependency Trees Improves Relation Extraction (authors' PyTorch implementation)

$ git clone https://github.com/qipeng/gcn-over-pruned-trees.git
GitHub social preview for qipeng/gcn-over-pruned-trees
Stars
372
372
Forks
70
70
Language
Python
License
Other
Created
Aug 22, 2018
8.1 years old
Last push
Jul 29, 2020

Categories

GitHub topics

More in Information Extraction

Information Extraction

yuhaozhang/tacred-relation

PyTorch implementation of the position-aware attention model for relation extraction

๐Ÿง  Natural Language Processing
PythonOtherupdated Apr 24, 2024
GitHub โ†—โ˜… 359โ‘‚ 95
Information Extraction

crownpku/Information-Extraction-Chinese

Chinese Named Entity Recognition with IDCNN/biLSTM+CRF, and Relation Extraction with biGRU+2ATT ไธญๆ–‡ๅฎžไฝ“่ฏ†ๅˆซไธŽๅ…ณ็ณปๆๅ–

๐Ÿท๏ธ Named Entity Recognition๐Ÿง  Natural Language Processing
Pythonno licenseupdated Feb 1, 2024
GitHub โ†—โ˜… 2.3Kโ‘‚ 796
Information Extraction

plkmo/BERT-Relation-Extraction

PyTorch implementation for "Matching the Blanks: Distributional Similarity for Relation Learning" paper

๐Ÿง  Natural Language Processing
PythonApache-2.0updated Sep 24, 2023
GitHub โ†—โ˜… 602โ‘‚ 133
Information Extraction

Babelscape/rebel

REBEL is a seq2seq model that simplifies Relation Extraction (EMNLP 2021).

๐Ÿง  Natural Language Processing
Pythonno licenseupdated Nov 9, 2023
GitHub โ†—โ˜… 576โ‘‚ 76
Information Extraction

SapienzaNLP/relik

Retrieve, Read and LinK: Fast and Accurate Entity Linking and Relation Extraction on an Academic Budget (ACL 2024)

๐Ÿง  Natural Language Processing
Pythonno licenseupdated Jul 29, 2025
GitHub โ†—โ˜… 518โ‘‚ 40
Information Extraction

Cartus/AGGCN

Attention Guided Graph Convolutional Networks for Relation Extraction (authors' PyTorch implementation for the ACL19 paper)

๐Ÿง  Natural Language Processing
PythonMITupdated Mar 22, 2022
GitHub โ†—โ˜… 436โ‘‚ 88

Data from GitHub ยท snapshot Sep 24, 2026