Coreference Resolution with Knowledge Haoruo Peng March 20, 2015 1.

Slides:



Advertisements
Similar presentations
Latent Variables Naman Agarwal Michael Nute May 1, 2013.
Advertisements

CrowdER - Crowdsourcing Entity Resolution
October 2014 Paul Kantor’s Fusion Fest Workshop Making Sense of Unstructured Data Dan Roth Department of Computer Science University of Illinois at Urbana-Champaign.
Large-Scale Entity-Based Online Social Network Profile Linkage.
Textual Relations Task Definition Annotate input text with disambiguated Wikipedia titles: Motivation Current state-of-the-art Wikifiers, using purely.
A Linear Programming Formulation for Global Inference in Natural Language Tasks Dan RothWen-tau Yih Department of Computer Science University of Illinois.
A Database of Nate Chambers and Dan Jurafsky Stanford University Narrative Schemas.
Leveraging Community-built Knowledge For Type Coercion In Question Answering Aditya Kalyanpur, J William Murdock, James Fan and Chris Welty Mehdi AllahyariSpring.
March 17, 2008SAC WT Hermes: a Semantic Web-Based News Decision Support System* Flavius Frasincar Erasmus University Rotterdam.
Introduction to CL Session 1: 7/08/2011. What is computational linguistics? Processing natural language text by computers  for practical applications.
A Structure Editor For PAL Constraints Anton An July 18, 2001.
MCTest-160 [1] contains pairs of narratives and multiple choice questions. An example of narrative QA: Story: “Sally had a very exciting summer vacation.
July 2015 Cognitum An IJCAI-15 Workshop on Cognitive Knowledge Acquisition and Applications Illinois-Profiler: Knowledge Schemas at Scale Zhiye Fei, Daniel.
Large-Scale Cost-sensitive Online Social Network Profile Linkage.
Adding Common Sense into Artificial Intelligence Common Sense Computing Initiative Software Agents Group MIT Media Lab.
STRUCTURED PERCEPTRON Alice Lai and Shi Zhi. Presentation Outline Introduction to Structured Perceptron ILP-CRF Model Averaged Perceptron Latent Variable.
A Discriminative Latent Variable Model for Online Clustering Rajhans Samdani, Kai-Wei Chang, Dan Roth Department of Computer Science University of Illinois.
Mining and Summarizing Customer Reviews
C OLLECTIVE ANNOTATION OF WIKIPEDIA ENTITIES IN WEB TEXT - Presented by Avinash S Bharadwaj ( )
A Grammar-based Entity Representation Framework for Data Cleaning Authors: Arvind Arasu Raghav Kaushik Presented by Rashmi Havaldar.
Attribute Extraction and Scoring: A Probabilistic Approach Taesung Lee, Zhongyuan Wang, Haixun Wang, Seung-won Hwang Microsoft Research Asia Speaker: Bo.
Reyyan Yeniterzi Weakly-Supervised Discovery of Named Entities Using Web Search Queries Marius Pasca Google CIKM 2007.
A Two Tier Framework for Context-Aware Service Organization & Discovery Wei Zhang 1, Jian Su 2, Bin Chen 2,WentingWang 2, Zhiqiang Toh 2, Yanchuan Sim.
Adaptor Grammars Ehsan Khoddammohammadi Recent Advances in Parsing Technology WS 2012/13 Saarland University 1.
Illinois-Coref: The UI System in the CoNLL-2012 Shared Task Kai-Wei Chang, Rajhans Samdani, Alla Rozovskaya, Mark Sammons, and Dan Roth Supported by ARL,
The Necessity of Combining Adaptation Methods Cognitive Computation Group, University of Illinois Experimental Results Title Ming-Wei Chang, Michael Connor.
Annotating Words using WordNet Semantic Glosses Julian Szymański Department of Computer Systems Architecture, Faculty of Electronics, Telecommunications.
A Language Independent Method for Question Classification COLING 2004.
I2B2 Shared Task 2011 Coreference Resolution in Clinical Text David Hinote Carlos Ramirez.
A Cross-Lingual ILP Solution to Zero Anaphora Resolution Ryu Iida & Massimo Poesio (ACL-HLT 2011)
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Indirect Supervision Protocols for Learning in Natural Language Processing II. Learning by Inventing Binary Labels This work is supported by DARPA funding.
Beyond Nouns Exploiting Preposition and Comparative adjectives for learning visual classifiers.
Page 1 March 2011 Local and Global Algorithms for Disambiguation to Wikipedia Lev Ratinov 1, Dan Roth 1, Doug Downey 2, Mike Anderson 3 1 University of.
An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming Xiaofeng Yang 1 Jian Su 1 Jun Lang 2 Chew Lim Tan 3 Ting Liu 2 Sheng.
Minimally Supervised Event Causality Identification Quang Do, Yee Seng, and Dan Roth University of Illinois at Urbana-Champaign 1 EMNLP-2011.
Relation Alignment for Textual Entailment Recognition Cognitive Computation Group, University of Illinois Experimental ResultsTitle Mark Sammons, V.G.Vinod.
Text Mining & NLP based Algorithm to populate ontology with A-Box individuals and object properties Alexandre Kouznetsov and Christopher J. O. Baker, University.
Named Entity Disambiguation on an Ontology Enriched by Wikipedia Hien Thanh Nguyen 1, Tru Hoang Cao 2 1 Ton Duc Thang University, Vietnam 2 Ho Chi Minh.
Inference Protocols for Coreference Resolution Kai-Wei Chang, Rajhans Samdani, Alla Rozovskaya, Nick Rizzolo, Mark Sammons, and Dan Roth This research.
Evaluating Answer Validation in multi- stream Question Answering Álvaro Rodrigo, Anselmo Peñas, Felisa Verdejo UNED NLP & IR group nlp.uned.es The Second.
Machine Learning Concept Learning General-to Specific Ordering
4. Relationship Extraction Part 4 of Information Extraction Sunita Sarawagi 9/7/2012CS 652, Peter Lindes1.
LINDEN : Linking Named Entities with Knowledge Base via Semantic Knowledge Date : 2013/03/25 Resource : WWW 2012 Advisor : Dr. Jia-Ling Koh Speaker : Wei.
Object Recognition as Ranking Holistic Figure-Ground Hypotheses Fuxin Li and Joao Carreira and Cristian Sminchisescu 1.
Making Holistic Schema Matching Robust: An Ensemble Approach Bin He Joint work with: Kevin Chen-Chuan Chang Univ. Illinois at Urbana-Champaign.
Department of Computer Science The University of Texas at Austin USA Joint Entity and Relation Extraction using Card-Pyramid Parsing Rohit J. Kate Raymond.
Overview of Statistical NLP IR Group Meeting March 7, 2006.
Discovering Complex Matchings across Web Query Interfaces: A Correlation Mining Approach Bin He Joint work with: Kevin Chen-Chuan Chang, Jiawei Han Univ.
Solving Hard Coreference Problems Haoruo Peng, Daniel Khashabi and Dan Roth Problem Description  Problems with Existing Coref Systems Rely heavily on.
gesture features for coreference
He Xiangnan Research Fellow National University of Singapore
Part 2 Applications of ILP Formulations in Natural Language Processing
Statistical Learning Methods for Natural Language Processing on the Internet 徐丹云.
Basic User Site Access Training & Producing Reports
NYU Coreference CSCI-GA.2591 Ralph Grishman.
Two Discourse Driven Language Models for Semantics
CIS 700 Advanced Machine Learning for NLP Inference Applications
Improving a Pipeline Architecture for Shallow Discourse Parsing
Lecture 24: NER & Entity Linking
Clustering Algorithms for Noun Phrase Coreference Resolution
Presentation 王睿.
Relational Inference for Wikification
Enhanced Dependency Jiajie Yu Wentao Ding.
CS246: Information Retrieval
Recommender Systems: Collaborative & Content-based Filtering Features
CS565: Intelligent Systems and Interfaces
Unsupervised Learning of Narrative Schemas and their Participants
The Winograd Schema Challenge Hector J. Levesque AAAI, 2011
Dan Roth Department of Computer Science
Presentation transcript:

Coreference Resolution with Knowledge Haoruo Peng March 20,

Coreference Problem 2

3

Online Demo Please check outhttp://cogcomp.cs.illinois.edu/page/demo_view/Corefhttp://cogcomp.cs.illinois.edu/page/demo_view/Coref 4

General Framework Mention Detection Pairwise Mention Scoring  Goal: Coreferent Mentions have higher scores Inference (ILP)  Best-Link  All-Link 5 Jack threw the bags of Mary into the water since he is angry with her.

ILP formulation of CR Best-Link All-Link 6

General Framework Learning (for Pairwise Mention Scores)  Structural SVM  Features: Mention Types, String Relations, Semantic, Relative Location, Anaphoricity(Learned), Aligned Modifiers, Memorization, etc. Evaluation  MUC  BCUB  CEAF_e IllinoisCoref 7 VS. Stanford Muti-pass Sieve System VS. Berkeley CR System

Difficulties in CR Hard Coreference Problems  [A bird] perched on the [limb] and [it] bent.  [Robert] is robbed by [Kevin], and [he] is arrested by police.  Gender / Plurality information cannot help  -> Requires Knowledge 8

Part 1 Solving Hard Coreference Problems 9

Hard Coreference Problems Motivating Examples Category 1  [A bird] perched on the [limb] and [it] bent.  [The bee] landed on [the flower] because [it] had pollen. Category 2  [Jack] is robbed by [Kevin], and [he] is arrested by police.  [Jim] was afraid of [Robert] because [he] gets scared around new people. Category 3  [Lakshman] asked [Vivan] to get him some ice cream because [he] was hot. 10

Predicate Schemas Type 1   (Cat1) [The bee] landed on [the flower] because [it] had pollen.  S(have(m=[the flower], a=[pollen])) > S(have(m=[the bee], a=[pollen])) Type 2   (Cat2) [Jim] was afraid of [Robert] because [he] gets scared around new people.  S(be afraid of(m=*, a=*) | get scared around(m=*, a=*), because) > S(be afraid of(a=*, m=*) | get scared around(m=*, a=*), because) 11 Sub Obj Shared Mention ^ ^

Predicate Schemas Possible variations for scoring function statistics. 12

Predicate Schemas in Coreference Pairwise Mention Scoring Function Scoring Function for Predicate Schemas We can add scores of Predicate Schemas as Features 13

Ways of Using Knowledge Major Disadvantages of Using Knowledge as Features  Noise in Knowledge  Inexplicit Textual Inference Alternative way  Using Knowledge as Constraints 14

Using Knowledge as Constraints Generating Constraints ILP inference (Best-Link) 15

Scores for Predicate Schemas Multiple Sources  Gigaword  Wikipedia  Web Search  Polarity Information 16

Scores for Predicate Schemas Gigaword  Chunking + Dependency Parsing => predicate(subject, object) => Type 1 Predicate Schema  Heuristic Coreference => Type 2 Predicate Schema Wikipedia  Entity Linking to ground on Wikipedia Entries (Disambiguation)  Gather Simple Statistics for 1) immediately after 2) immediately before 3) after 4) before => predicate(subject, object) (approximation) => Type 1 Predicate Schema 17

Scores for Predicate Schemas Web Search  Google Query with Quote (counts)  “m predicate”, “m a”, “a m”, “m predicate a” => Type 1 Predicate Schema Polarity Information  Polarity on predicates => Polarity on mentions  Negate polarity if mention is object  Negate polarity for polarity-reversing connective  +1 if polarities for mentions are the same -1 if polarities for mentions are different => Type 2 Predicate Schema 18

Recap Things to consider for using knowledge in NLP  Knowledge Representation Predicate Schema  Knowledge Inference Features VS. Inference  Knowledge Acquisition Multiple Sources 19

Datasets Winograd dataset 1  [The bee] landed on [the flower] because [it] had pollen. [The bee] landed on [the flower] because [it] wanted pollen.   [Jack] threw the bags of [John] into the water since [he] mistakenly asked him to carry his bags. WinoCoref dataset

Evaluation on Hard Coreference DatasetWinogradWinoCoref MetricPrecisionAntePre Illinois IlliCons Rahman and Ng (2012)73.05—– KnowFeat KnowCons KnowComb

Evaluation on Standard Coreference 22

Analysis on Effects of Schemas 23

Part 2 Profiler: Knowledge Schemas at Scale 24

Goal How to enlarge the Knowledge acquired from text  Data Volume  Schema Richness Profiler  Demo: 25

Motivation 26

Enriched Schemas 27

Enriched Schemas 28

Enriched Schemas 29

Implementation 30

Effect of Wikification (Entity-Linking) 31

Effect of Wikification (Entity-Linking) 32

Knowledge Visualization 33

Knowledge Visualization 34

Publications [1] Solving Hard Coreference Problems. Haoruo Peng*, Daniel Khashabi* and Dan Roth. NAACL [2] A Joint Framework for Mention Head Detection and Coreference Resolution. Submitted to ACL [3] Profiler: Knowledge Schemas at Scale. Submitted to Transactions of ACL

Future Directions The use of world knowledge in NLP tasks  Knowledge Representation (schemas) Is co-occurrence information enough?  Knowledge Inference Sparsity Issues  Knowledge Acquisition Which sources to choose? Interpolation /  Tasks beyond CR (CR can be seen as a subset of AI-complete problems) Outlier Detection for Singleton Mentions 36

Collaborators Daniel Khashabi Zhiye Fei Kaiwei Chang Prof. Dan Roth 37

38 Thank You !

Difficulties in CR Hard Coreference Problems  Ex.1 [A bird] perched on the [limb] and [it] bent.  Ex.2 [Robert] is robbed by [Kevin], and [he] is arrested by police.  Gender / Plurality information cannot help  -> Requires Knowledge Performance Gaps  -> Requires Better Mention Detection 39 SystemDatasetGoldPredictedGap IllinoisCoNLL BerkeleyCoNLL StanfordACE

A Joint Framework for Mention Head Detection and Coreference Resolution Goal: Improve CR on predicted mentions (End-to-End) Solution:  Traditional: MD -> Coref  Our paper: Mention Head -> Joint Coref -> Head to Mention  Joint Learning / Inference Step Add decision variables to decide whether to choose a head or not Joint Coref is able to reject some mention head candidates Results 40 [Multinational companies investing in [China]] had become so angry that [they] recently set up an anti-piracy league to pressure [the [Chinese] government] to take action. [Domestic manufacturers, [who] are also suffering], launched a similar body this month. DatasetIllinoisBaselineOur Paper ACE CoNLL

ILP formulation of CR Best-Link with Knowledge Constraints Best-Link with Joint Mention Detection 41