Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leveraging Dependency Forest for Neural Medical Relation Extraction (1911.04123v2)

Published 11 Nov 2019 in cs.CL

Abstract: Medical relation extraction discovers relations between entity mentions in text, such as research articles. For this task, dependency syntax has been recognized as a crucial source of features. Yet in the medical domain, 1-best parse trees suffer from relatively low accuracies, diminishing their usefulness. We investigate a method to alleviate this problem by utilizing dependency forests. Forests contain many possible decisions and therefore have higher recall but more noise compared with 1-best outputs. A graph neural network is used to represent the forests, automatically distinguishing the useful syntactic information from parsing noise. Results on two biomedical benchmarks show that our method outperforms the standard tree-based methods, giving the state-of-the-art results in the literature.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Linfeng Song (76 papers)
  2. Yue Zhang (620 papers)
  3. Daniel Gildea (28 papers)
  4. Mo Yu (117 papers)
  5. Zhiguo Wang (100 papers)
  6. Jinsong Su (96 papers)
Citations (32)

Summary

We haven't generated a summary for this paper yet.