Unsupervised Entity-Relation Analysis in IBM Watson
نویسندگان
چکیده
Text paraphrasing algorithms play a fundamental role in several NLP applications such as automated question answering (QA), summarization and machine translation. We propose a novel paraphrasing approach based on an entity-relation (ER) analysis of text. The algorithm uses a combination of deep linguistic analysis (part of speech, dependency parse information) and background resources (NGram, PRISMATIC KB, domain dictionaries) to detect and match entities and relations. We evaluate the ER approach in a QA setting by adding it to the suite of passage scoring algorithms in IBM Watson, a state-of-the-art question answering system. We show a statistically significant improvement in the ability of IBM Watson to identify justifying passages.
منابع مشابه
Question analysis: How Watson reads a clue
Watson reads a clue A. Lally J. M. Prager M. C. McCord B. K. Boguraev S. Patwardhan J. Fan P. Fodor J. Chu-Carroll The first stage of processing in the IBM Watsoni system is to perform a detailed analysis of the question in order to determine what it is asking for and how best to approach answering it. Question analysis uses Watson’s parsing and semantic analysis capabilities: a deep Slot Gramm...
متن کاملUnsupervised Feature Selection for Relation Extraction
This paper presents an unsupervised relation extraction algorithm, which induces relations between entity pairs by grouping them into a “natural” number of clusters based on the similarity of their contexts. Stability-based criterion is used to automatically estimate the number of clusters. For removing noisy feature words in clustering procedure, feature selection is conducted by optimizing a ...
متن کاملDeep parsing in Watson
M. C. McCord J. W. Murdock B. K. Boguraev Two deep parsing components, an English Slot Grammar (ESG) parser and a predicate-argument structure (PAS) builder, provide core linguistic analyses of both the questions and the text content used by IBM Watsoni to find and hypothesize answers. Specifically, these components are fundamental in question analysis, candidate generation, and analysis of pas...
متن کاملUnsupervised Open Relation Extraction
We explore methods to extract relations between named entities from free text in an unsupervised setting. In addition to standard feature extraction, we develop a novel method to re-weight word embeddings. We alleviate the problem of features sparsity using an individual feature reduction. Our approach exhibits a significant improvement by 5.8% over the state-of-the-art relation clustering scor...
متن کاملStructured Relation Discovery using Generative Models
We explore unsupervised approaches to relation extraction between two named entities; for instance, the semantic bornIn relation between a person and location entity. Concretely, we propose a series of generative probabilistic models, broadly similar to topic models, each which generates a corpus of observed triples of entity mention pairs and the surface syntactic dependency path between them....
متن کامل