Extracting N-ary Cross-sentence Relations using Constrained Subsequence Kernel
원문 초록
Most of the past work in relation extraction deals with relations occurring within a sentence and having only two entity arguments. We propose a new formulation of the relation extraction task where the relations are more general than intra-sentence relations in the sense that they may span multiple sentences and may have more than two arguments. Moreover, the relations are more specific than corpus-level relations in the sense that their scope is limited only within a document and not valid globally throughout the corpus. We propose a novel sequence representation to characterize instances of such relations. We then explore various classifiers whose features are derived from this sequence representation. For SVM classifier, we design a Constrained Subsequence Kernel which is a variant of Generalized Subsequence Kernel. We evaluate our approach on three datasets across two domains: biomedical and general domain.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Chaining Event Spans for Temporal Relation Grounding
A MISMATCHED Benchmark for Scientific Natural Language Inference
Comparative Analysis of AI Agent Architectures for Entity Relationship Classification
Towards a More Generalized Approach in Open Relation Extraction
MedScore: Factuality Evaluation of Free-Form Medical Answers
Towards Rehearsal-Free Continual Relation Extraction: Capturing Within-Task Variance with Adaptive Prompting
토론
이 논문과 연결된 포럼 글이 아직 없습니다.