Reading The Web with Learned Syntactic-Semantic Inference Rules
FigsharePublished 29 June 2018Open access
Ni Lao, Amarnag Subramanya, Fernando Pereira, William W. Cohen
Citations83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A distributed, Web-scale implementation of a path-constrained random walk model that learns syntactic-semantic inference rules for binary relations from a graph representation of the parsed text and the knowledge base is described.
Abstract
We study how to extend a large knowledge base (Freebase) by reading relational information from a large Web text corpus. Previous studies on extracting relational knowledge from text show the potential of syntactic patterns for extraction, but they do not exploit background knowledge of other relations in the knowledge base. We describe a distributed, Web-scale implementation of a path-constrained random walk model that learns syntactic-semantic inference rules for binary relations from a graph representation of the parsed text and the knowledge base. Experiments show significant accuracy improvements in binary relation prediction over methods that consider only text, or only the existing knowledge base.
Keywords
Computer Science
Communications of the ACMMapReduce
18,538 Citations2008Jay B. Dean, Sanjay Ghemawat
This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Freebase
4,892 Citations2008Kurt Bollacker, Colin Evans +3 more
MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web-based data-oriented applications.
Automatic acquisition of hyponyms from large text corpora
3,283 Citations1992Marti A. Hearst
A set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest are identified.
Accurate unlexicalized parsing
3,055 Citations2003Dan Klein, Christopher D. Manning
It is demonstrated that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar.
Distant supervision for relation extraction without labeled data
2,913 Citations2009Mike D. Mintz, Steven Bills +2 more
This work investigates an alternative paradigm that does not require labeled corpora, avoiding the domain dependence of ACE-style algorithms, and allowing the use of corpora of any size.
Machine LearningMarkov logic networks
2,678 Citations2006Matthew Richardson, Pedro Domingos
Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach to combining first-order logic and probabilistic graphical models in a single representation.
<i>Snowball</i>
1,169 Citations2000Eugene Agichtein, Luis Gravano
This paper develops a scalable evaluation methodology and metrics for the task, and presents a thorough experimental evaluation of Snowball and comparable techniques over a collection of more than 300,000 newspaper documents.
Learning Probabilistic Relational Models
941 Citations2001Lise Getoor, Nir Friedman +2 more
Learning surface text patterns for a Question Answering system
813 Citations2001Deepak Ravichandran, Eduard Hovy
This paper has developed a method for learning an optimal set of surface text patterns automatically from a tagged corpus, and calculates the precision of each pattern, and the average precision for each question type.
Web-scale information extraction in knowitall
753 Citations2004Oren Etzioni, Michael Cafarella +7 more
KnowItAll, a system that aims to automate the tedious process of extracting large collections of facts from the web in an autonomous, domain-independent, and scalable manner, is introduced.
Neural Information Processing SystemsLearning Syntactic Patterns for Automatic Hypernym Discovery
676 Citations2004Rion Snow, Daniel Jurafsky +1 more
This paper presents a new algorithm for automatically learning hypernym (is-a) relations from text, using "dependency path" features extracted from parse trees and introduces a general-purpose formalization and generalization of these patterns.
Machine LearningRelational retrieval using a combination of path-constrained random walks
630 Citations2010Ni Lao, William W. Cohen
A novel learnable proximity measure is described which instead uses one weight per edge label sequence: proximity is defined by a weighted combination of simple “path experts”, each corresponding to following a particular sequence of labeled edges.
FigshareRandom Walk Inference and Learning in A Large Scale Knowledge Base
521 Citations2018Ni Lao, Tom M. Mitchell +1 more
It is shown that a soft inference procedure based on a combination of constrained, weighted, random walks through the knowledge base graph can be used to reliably infer new beliefs for theknowledge base.
Integrating probabilistic extraction models and data mining to discover relations and patterns in text
214 Citations2006Aron Culotta, Andrew McCallum +1 more
A probabilistic extraction model is described that provides mutual benefits to both "top-down" relational pattern discovery and "bottom-up" relation extraction.
Simple coreference resolution with rich syntactic and semantic features
197 Citations2009Aria Haghighi, Dan Klein
This work presents a simple approach which completely modularizes these three aspects of coreference, which is deterministic and is driven entirely by syntactic and semantic compatibility as learned from a large, unlabeled corpus.
Combining linguistic and statistical analysis to extract relations from web documents
187 Citations2006Fabian M. Suchanek, Georgiana Ifrim +1 more
It is shown that this approach profits significantly when deep linguistic structures are used instead of surface text patterns, and the benefits of this approach are shown by extensive experiments with the prototype system LEILA.
Empirical Methods in Natural Language ProcessingConstraints Based Taxonomic Relation Classification
18 Citations2010Quang Do, Dan Roth
A system that, given two terms, determines the taxonomic relation between them using a machine learning-based approach that makes use of existing resources and significantly outperforms other systems built upon existing well-known knowledge sources.