1 / 1

Textual Relations

Relational Inference for Wikification. Xiao Cheng and Dan Roth.

rich
Download Presentation

Textual Relations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Relational Inference for Wikification Xiao Cheng and Dan Roth Blumenthal (D) is a candidate for the U.S. Senate seat now held by Christopher Dodd(D), and he has held a commanding lead in the race since he entered it. But the Times report has the potential to fundamentally reshape the contest in the Nutmeg State. • Task Definition • Annotate input text with disambiguated Wikipedia titles: • Motivation • Current state-of-the-art Wikifiers, using purely statistical methods, already achieve good performance, leveling off at around 75%~80% F1 • Limitation of Bag-of-words representation Textual Relations Relation Inference Relation Retrieval Relational Wikification Approach Identify Textual Relations Retrieve Relational Knowledge Formulate the inference problem Rerank via constraints Promote candidate pair: Slobodan_Milošević Socialist_Party_of_Serbia Demo: http://cogcomp.cs.illinois.edu/demo/wikify/ • Evaluations • Achieves significant improvement over the previous state-of-the-art systems • Run the Relational Inference Wikifier (RI) “as-is” without retraining on the target domain, still obtains significant gain over our previous submitted Entity Linking system(Cogcomp). • Discussion • We are interested in extracting high-precision textual relations that help with disambiguation. Specifically, we focus on the following types of relations: • Syntactico-semantic relations (Chan & Roth ‘10) • Coreference relations • Acronyms, partial names, nominal mentions ...ousted long time Yugoslav PresidentSlobodan Milošević in October. Mr. Milošević'sSocialist Party… Socialist Party of Serbia From Wikipedia, the free encyclopedia Slobodan Milošević From Wikipedia, the free encyclopedia founded Connecticut From Wikipedia, the free encyclopedia Richard Blumenthal From Wikipedia, the free encyclopedia Democratic Party (United States) From Wikipedia, the free encyclopedia United States Senate From Wikipedia, the free encyclopedia Chris Dodd From Wikipedia, the free encyclopedia The New York Times From Wikipedia, the free encyclopedia • Uses DBPedia and Wikipedia page link relations as our knowledge base • Retrieve lexically similar candidates and filter • q1=(Socialist Party of France,?, *Milošević*) • q2=(Slobodan Milošević,?,*Socialist Party*) Mubarak, the wife of deposed Egyptian President Hosni Mubarak, … • Bag-of-words loses important relational information • Modeling constraining interaction between concepts • Need to link Mubarak to Suzanne Mubarak • Identify relation (Mubarak, wife, Hosni Mubarak) • Promote apair of candidates that is coherent with text meaning Mubarak Egyptian President Hosni Mubarak wife • For each pair of entity candidates and , represents whether we found a relation in the text between their mentions AND a relation in our knowledge base • either rewards or penalizes a relation for its coherency with the text. • Relation scoring • Relaxes constraint when ambiguity exists • Scores each retrieved relation for each query • is the relation weight for different knowledge source • is the lexical similarity between the query and the retrieved relation • is a normalization factor, keeping the weights for each pair of mentions between 0 and 1 • Special handling of “local knowledge” • Creates NIL entity candidate for inference propagation, so that locally extracted high precision knowledge can be considered across long-range textual relations • Uses off-the-shelf Integer Linear Programming (ILP) packages to optimize the objective function High-level algorithm description We show that both linguistic and world knowledge, specifically the ability to use relational information, are crucial in the task of Wikification. To do that, we introduce an extensible and efficient inference framework that leverages better language understanding. Additional work is needed to accumulate and better integrate our knowledge about NIL entities to fully address the Entity Linking task and handle additional encyclopedic resources. The performance gains and error analysis also calls for joint entity typing, coreference and disambiguation. References: X. Cheng and D. Roth, Relational Inference for Wikification. EMNLP’13 L. Ratinov and D. Roth and D. Downey and M. Anderson, Local and Global Algorithms for Disambiguation to Wikipedia. ACL’11 This research is sponsored by DARPA under agreement number FA8750-13-2-0008, and partly supported by the IARPA under contract number D11PC20155, by the ARL under agreement W911NF-09-2-0053, and by the Multimodal Information Access & Synthesis Center at UIUC.

More Related