Multi-Round Parsing-based Multiword Rules for Scientific OpenIE
- URL: http://arxiv.org/abs/2108.02074v1
- Date: Wed, 4 Aug 2021 14:17:48 GMT
- Title: Multi-Round Parsing-based Multiword Rules for Scientific OpenIE
- Authors: Joseph Kuebler and Lingbo Tong and Meng Jiang
- Abstract summary: OpenIE identifies a relational phrase to describe the relationship between a subject and an object.
In this work, we present a set of rules for extracting structured information based on dependency parsing.
Results on novel datasets show the effectiveness of the proposed method.
- Score: 18.163915930906693
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Information extraction (IE) in scientific literature has facilitated many
down-stream tasks. OpenIE, which does not require any relation schema but
identifies a relational phrase to describe the relationship between a subject
and an object, is being a trending topic of IE in sciences. The subjects,
objects, and relations are often multiword expressions, which brings challenges
for methods to identify the boundaries of the expressions given very limited or
even no training data. In this work, we present a set of rules for extracting
structured information based on dependency parsing that can be applied to any
scientific dataset requiring no expert's annotation. Results on novel datasets
show the effectiveness of the proposed method. We discuss negative results as
well.
Related papers
- SciER: An Entity and Relation Extraction Dataset for Datasets, Methods, and Tasks in Scientific Documents [49.54155332262579]
We release a new entity and relation extraction dataset for entities related to datasets, methods, and tasks in scientific articles.
Our dataset contains 106 manually annotated full-text scientific publications with over 24k entities and 12k relations.
arXiv Detail & Related papers (2024-10-28T15:56:49Z) - Dissecting Paraphrases: The Impact of Prompt Syntax and supplementary Information on Knowledge Retrieval from Pretrained Language Models [8.588056811772693]
ConPARE-LAMA is a probe consisting of 34 million distinct prompts that facilitate comparison across minimal paraphrases.
ConPARE-LAMA enables insights into the independent impact of either syntactical form or semantic information of paraphrases on the knowledge retrieval performance of PLMs.
arXiv Detail & Related papers (2024-04-02T14:35:08Z) - CARE: Extracting Experimental Findings From Clinical Literature [29.763929941107616]
This work presents CARE, a new IE dataset for the task of extracting clinical findings.
We develop a new annotation schema capturing fine-grained findings as n-ary relations between entities and attributes.
We collect extensive annotations for 700 abstracts from two sources: clinical trials and case reports.
arXiv Detail & Related papers (2023-11-16T10:06:19Z) - Conversational Semantic Parsing using Dynamic Context Graphs [68.72121830563906]
We consider the task of conversational semantic parsing over general purpose knowledge graphs (KGs) with millions of entities, and thousands of relation-types.
We focus on models which are capable of interactively mapping user utterances into executable logical forms.
arXiv Detail & Related papers (2023-05-04T16:04:41Z) - Enriching Relation Extraction with OpenIE [70.52564277675056]
Relation extraction (RE) is a sub-discipline of information extraction (IE)
In this work, we explore how recent approaches for open information extraction (OpenIE) may help to improve the task of RE.
Our experiments over two annotated corpora, KnowledgeNet and FewRel, demonstrate the improved accuracy of our enriched models.
arXiv Detail & Related papers (2022-12-19T11:26:23Z) - CitationIE: Leveraging the Citation Graph for Scientific Information
Extraction [89.33938657493765]
We use the citation graph of referential links between citing and cited papers.
We observe a sizable improvement in end-to-end information extraction over the state-of-the-art.
arXiv Detail & Related papers (2021-06-03T03:00:12Z) - Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole.
We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
arXiv Detail & Related papers (2021-01-16T16:18:43Z) - A Comparative Study on Structural and Semantic Properties of Sentence
Embeddings [77.34726150561087]
We propose a set of experiments using a widely-used large-scale data set for relation extraction.
We show that different embedding spaces have different degrees of strength for the structural and semantic properties.
These results provide useful information for developing embedding-based relation extraction methods.
arXiv Detail & Related papers (2020-09-23T15:45:32Z) - Extracting Semantic Concepts and Relations from Scientific Publications
by Using Deep Learning [0.0]
The aim of this paper is to introduce a proposal of automatically extracting semantic concepts and relations from scientific publications.
This paper suggests new types of semantic relations and points out of using deep learning (DL) models for semantic relation extraction.
arXiv Detail & Related papers (2020-09-01T10:19:18Z) - Edge-Enhanced Graph Convolution Networks for Event Detection with
Syntactic Relation [14.823029993354794]
Event detection is a key subtask of information extraction.
We propose a novel architecture named Edge-Enhanced Graph Convolution Networks (EE-GCN)
EE-GCN simultaneously exploits syntactic structure and typed dependency label information to perform ED.
arXiv Detail & Related papers (2020-02-25T09:18:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.