Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 200

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

N-ary Relation Extraction using Graph-State LSTM

Open access
Song, Linfeng, Zhang, Yue, Wang, Zhiguo, Gildea, Daniel·2018·Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing

Abstract

Cross-sentence n-ary relation extraction detects relations among n entities across multiple sentences.Typical methods formulate an input as a document graph, integrating various intra-sentential and inter-sentential dependencies.The current state-of-the-art method splits the input graph into two DAGs, adopting a DAG-structured LSTM for each.Though being able to model rich linguistic knowledge by leveraging graph edges, important information can be lost in the splitting procedure.We propose a graph-state LSTM model, which uses a parallel state to model each word, recurrently enriching state values via message passing.Compared with DAG LSTMs, our graph LSTM keeps the original graph structure, and speeds up computation by allowing more parallelization.On a standard benchmark, our model shows the best result in the literature.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/d18-1246

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 200

Metadata

Authors
Song, L., Zhang, Y., Wang, Z., & Gildea, D.
Venue
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Published
2018
Pages
2226-2235
OpenAlex
W2889224519
Cited by
200
References
3
FWCI
13.11
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: N-ary Relation Extraction using Graph-State LSTM. https://app.cochat.ai/papers/10.18653/v1/d18-1246
The paper
Song, L., Zhang, Y., Wang, Z., & Gildea, D. (2018). N-ary Relation Extraction using Graph-State LSTM. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d18-1246

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.