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

Extracting N-ary Cross-sentence Relations using Constrained Subsequence Kernel (2006.08185v1)

Published 15 Jun 2020 in cs.CL

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Sachin Pawar (11 papers)
  2. Pushpak Bhattacharyya (153 papers)
  3. Girish K. Palshikar (9 papers)
Citations (1)

Summary

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