SOTAVerified

Pynsett: A programmable relation extractor

2020-07-04Code Available1· sign in to hype

Alberto Cetoli

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

This paper proposes a programmable relation extraction method for the English language by parsing texts into semantic graphs. A person can define rules in plain English that act as matching patterns onto the graph representation. These rules are designed to capture the semantic content of the documents, allowing for flexibility and ad-hoc entities. Relation extraction is a complex task that typically requires sizable training corpora. The method proposed here is ideal for extracting specialized ontologies in a limited collection of documents.

Tasks

Reproductions