Gerhard Weikum Max Planck Institute for Informatics For a Few Triples More.

Slides:



Advertisements
Similar presentations
Automatic Timeline Generation from News Articles Josh Taylor and Jessica Jenkins.
Advertisements

Google News Personalization: Scalable Online Collaborative Filtering
Date: 2014/05/06 Author: Michael Schuhmacher, Simon Paolo Ponzetto Source: WSDM’14 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Knowledge-based Graph Document.
Gerhard Weikum Max Planck Institute for Informatics & Saarland University Semantic Search: from Names and Phrases to.
Linking Entities in #Microposts ROMIL BANSAL, SANDEEP PANEM, PRIYA RADHAKRISHNAN, MANISH GUPTA, VASUDEVA VARMA INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY,
Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2007) Learning for Semantic Parsing Advisor: Hsin-His.
Towards Twitter Context Summarization with User Influence Models Yi Chang et al. WSDM 2013 Hyewon Lim 21 June 2013.
Linking Named Entity in Tweets with Knowledge Base via User Interest Modeling Date : 2014/01/22 Author : Wei Shen, Jianyong Wang, Ping Luo, Min Wang Source.
Sequence Clustering and Labeling for Unsupervised Query Intent Discovery Speaker: Po-Hsien Shih Advisor: Jia-Ling Koh Source: WSDM’12 Date: 1 November,
GENERATING AUTOMATIC SEMANTIC ANNOTATIONS FOR RESEARCH DATASETS AYUSH SINGHAL AND JAIDEEP SRIVASTAVA CS DEPT., UNIVERSITY OF MINNESOTA, MN, USA.
Context-aware Query Suggestion by Mining Click-through and Session Data Authors: H. Cao et.al KDD 08 Presented by Shize Su 1.
Mining Wiki Resources for Multilingual Named Entity Recognition Alexander E. Richman & Patrick Schone Reporter: Chia-Ying Lee Advisor: Prof. Hsin-Hsi Chen.
Information Retrieval in Practice
Search Engines and Information Retrieval
 Copyright 2005 Digital Enterprise Research Institute. All rights reserved. 1 The Architecture of a Large-Scale Web Search and Query Engine.
Gimme’ The Context: Context- driven Automatic Semantic Annotation with CPANKOW Philipp Cimiano et al.
Web Projections Learning from Contextual Subgraphs of the Web Jure Leskovec, CMU Susan Dumais, MSR Eric Horvitz, MSR.
The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.
Overview of Search Engines
Information Retrieval in Practice
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
Semantic Web outlook and trends May The Past 24 Odd Years 1984 Lenat’s Cyc vision 1989 TBL’s Web vision 1991 DARPA Knowledge Sharing Effort 1996.
Extracting Key Terms From Noisy and Multi-theme Documents Maria Grineva, Maxim Grinev and Dmitry Lizorkin Institute for System Programming of RAS.
Search Engines and Information Retrieval Chapter 1.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
C OLLECTIVE ANNOTATION OF WIKIPEDIA ENTITIES IN WEB TEXT - Presented by Avinash S Bharadwaj ( )
Gerhard Weikum Max Planck Institute for Informatics Knowledge Harvesting from Text and Web Sources Part 3: Knowledge.
Semantic Publishing Update Second TUC meeting Munich 22/23 April 2013 Barry Bishop, Ontotext.
Graphical models for part of speech tagging
PLATFORM INDEPENDENT SOFTWARE DEVELOPMENT MONITORING Mária Bieliková, Karol Rástočný, Eduard Kuric, et. al.
Semantic Search: different meanings. Semantic search: different meanings Definition 1: Semantic search as the problem of searching documents beyond the.
URI Disambiguation in the Context of Linked Data Afraz Jaffri, Hugh Glaser, Ian MillardECS, University of Southampton
Pete Bohman Adam Kunk. What is real-time search? What do you think as a class?
 Text Representation & Text Classification for Intelligent Information Retrieval Ning Yu School of Library and Information Science Indiana University.
Automatic Detection of Tags for Political Blogs Khairun-nisa Hassanali Vasileios Hatzivassiloglou The University.
NLP And The Semantic Web Dainis Kiusals COMS E6125 Spring 2010.
This work is supported by the Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center contract number.
Péter Schönhofen – Ad Hoc Hungarian → English – CLEF Workshop 20 Sep 2007 Performing Cross-Language Retrieval with Wikipedia Participation report for Ad.
1 Learning Sub-structures of Document Semantic Graphs for Document Summarization 1 Jure Leskovec, 1 Marko Grobelnik, 2 Natasa Milic-Frayling 1 Jozef Stefan.
BAA - Big Mechanism using SIRA Technology Chuck Rehberg CTO at Trigent Software and Chief Scientist at Semantic Insights™
LOD for the Rest of Us Tim Finin, Anupam Joshi, Varish Mulwad and Lushan Han University of Maryland, Baltimore County 15 March 2012
Q2Semantic: A Lightweight Keyword Interface to Semantic Search Haofen Wang 1, Kang Zhang 1, Qiaoling Liu 1, Thanh Tran 2, and Yong Yu 1 1 Apex Lab, Shanghai.
Natural Language Questions for the Web of Data Mohamed Yahya, Klaus Berberich, Gerhard Weikum Max Planck Institute for Informatics, Germany Shady Elbassuoni.
Natural Language Questions for the Web of Data Mohamed Yahya 1, Klaus Berberich 1, Shady Elbassuoni 2 Maya Ramanath 3, Volker Tresp 4, Gerhard Weikum 1.
Graph-based Text Classification: Learn from Your Neighbors Ralitsa Angelova , Gerhard Weikum : Max Planck Institute for Informatics Stuhlsatzenhausweg.
Natural Language Questions for the Web of Data 1 Mohamed Yahya, Klaus Berberich, Gerhard Weikum Max Planck Institute for Informatics, Germany 2 Shady Elbassuoni.
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
PCI th Panhellenic Conference in Informatics Clustering Documents using the 3-Gram Graph Representation Model 3 / 10 / 2014.
Introduction to the Semantic Web and Linked Data
Using linked data to interpret tables Varish Mulwad September 14,
Natural Language Questions for the Web of Data Mohamed Yahya, Klaus Berberich, Gerhard Weikum Max Planck Institute for Informatics, Germany Shady Elbassuoni.
Shridhar Bhalerao CMSC 601 Finding Implicit Relations in the Semantic Web.
2015/12/121 Extracting Key Terms From Noisy and Multi-theme Documents Maria Grineva, Maxim Grinev and Dmitry Lizorkin Proceeding of the 18th International.
Named Entity Recognition in Query Jiafeng Guo 1, Gu Xu 2, Xueqi Cheng 1,Hang Li 2 1 Institute of Computing Technology, CAS, China 2 Microsoft Research.
Tutorial: Knowledge Bases for Web Content Analytics
Acquisition of Categorized Named Entities for Web Search Marius Pasca Google Inc. from Conference on Information and Knowledge Management (CIKM) ’04.
KAnOE: Research Centre for Knowledge Analytics and Ontological Engineering Managing Semantic Data NACLIN-2014, 10 Dec 2014 Dr. Kavi Mahesh Dean of Research,
Exploiting Named Entity Taggers in a Second Language Thamar Solorio Computer Science Department National Institute of Astrophysics, Optics and Electronics.
A Portrait of the Semantic Web in Action Jeff Heflin and James Hendler IEEE Intelligent Systems December 6, 2010 Hyewon Lim.
Enhanced hypertext categorization using hyperlinks Soumen Chakrabarti (IBM Almaden) Byron Dom (IBM Almaden) Piotr Indyk (Stanford)
Cold-Start KBP Something from Nothing Sean Monahan, Dean Carpenter Language Computer.
Mining Tag Semantics for Social Tag Recommendation Hsin-Chang Yang Department of Information Management National University of Kaohsiung.
GoRelations: an Intuitive Query System for DBPedia Lushan Han and Tim Finin 15 November 2011
Semi-Supervised Recognition of Sarcastic Sentences in Twitter and Amazon -Smit Shilu.
Information Retrieval in Practice
Summarizing Entities: A Survey Report
Discovering Emerging Entities with Ambiguous Names
DBpedia 2014 Liang Zheng 9.22.
A Graph-Based Approach to Learn Semantic Descriptions of Data Sources
Summarization for entity annotation Contextual summary
Presentation transcript:

Gerhard Weikum Max Planck Institute for Informatics For a Few Triples More

Acknowledgements

LOD: RDF Triples on the Web

owl:sameAs rdf.freebase.com/ns/ en.rome owl:sameAs data.nytimes.com/ Coord geonames.org/ /roma N 41° 54' 10'' E 12° 29' 2'' dbpprop:citizenOf dbpedia.org/resource/ Rome rdf:type rdfs:subclassOf yago/ wordnet:Actor rdf:type rdfs:subclassOf yago/ wikicategory:ItalianComposer yago/ wordnet: Artist prop:actedIn imdb.com/name/nm / LOD: Linked RDF Triples on the Web prop: composedMusicFor imdb.com/title/tt / dbpedia.org/resource/ Ennio_Morricone

LOD: Linked RDF Triples on the Web Size: 30 Billion triples Linkage: 500 Million links Dynamics:encyclopedic reference data

The Good, the Bad, and the Ugly

30 billion triples – still not enough ? No! Consider: 1.Dynamics 2.Linkage 3.Ubiquity For a Few Triples More

Outline Why More Triples: Dynamics, Linkage, Ubiquity Web-Scale Linkage Explain Title  Wrap-up Linkage & Ubiquity: Named-Entity Disambiguation

1. Dynamics: in a Fast Paced World Anecdotic examples: Chairman and CEO, Apple Inc. <dcterms:subject rdf:resource= " Category:Nobel_Peace_Prize_laureates”/> Dina Ruiz 1 child Maggie Johnson 2 children Nancy Shevell still there not there never there both there none there

1. Dynamics: As Fresh As Possible

1. Dynamics: Updates in the Web of Data

1. Dynamics: Closer to the Sources RDF Data on the Web produced by: Maintained, but mostly „static“ reference collections (e.g. geo) Periodic exports from curated databases (e.g. gov, bio, music) Periodic extraction from Web sources (e.g. encyclopedia, news) Tags in social streams and advertisements mostly fresh often stale very noisy  Get closer to the data origin: RDF engines (Sparql APIs) for production DBs view-maintenance by pub-sub push (feeds) Deep-Web crawl/query for surfacing of RDF data

1. Dynamics: Nothing Lasts Forever Even old and „static“ data often needs temporal scope (timepoint, timespan) for proper interpretation Need to add temporal properties to RDF and SPARQL with reification, or use quads (quints, pints, etc.) [11-Jun-2002, 2008] [Oct-2011, now] [1999] PaulMcCartney hasSpouse HeatherMills PaulMcCartney hasSpouse NancyShevell PaulMcCartney gotHonor SirPaul 1: 2: 3: 1 validFrom 11-Jun validUntil validFrom Oct happendOn 1999 Select ?w Where { ?id1: PM gotHonor SirPaul. ?id1 happendOn ?t. ?id2: PM hasSpouse ?w. ?id2 validFrom ?b. ?id2 validUntil ?e. ?t containedIn [?b,?e]. } but: principled, expressive, easy-to-use

1. Dynamics: Nothing Lasts Forever

2. Linkage: sameAs Links dbpedia.org/resource/Linda_Louise_Eastman owl:sameAs yago-knowledge.org/resource/Linda_McCartney owl:SameAs dbpedia.org/page/Clint_Eastwood data.linkedmdb.org/page/film/38166 owl:sameAs de.dbpedia.org/page/Zwei_glorreiche_Halunken LOD statistics: 30 Bio. triples, 500 Mio. links 330 Mio. links trivial (ID-based) within pub, within bio 10‘s Mio. links near-trivial Dbpedia  Freebase  Yago  GeoNames sameas.org: 17 Mio. bundles for 50 Mio. URIs data.nytimes.com: 5000 people, 2000 locations Way too few for a world with: 1 Mio. people, 10 Mio. locations, 10‘s Mio. species, 6 Mio. books, 2 Mio. movies, 10 Mio. songs, etc. etc.

2. Linkage: sameAs Coverage

2. Linkage: sameAs Accuracy

3. Ubiquity: Web-of-Data & Web-of-Contents

3. Ubiquity: Web of Data & Other Contents RDF data and Web contents need to be interconnected RDFa & microformats provide the mechanism How do we get the Web RDF-annotated (at large scale)? Largely automated, but allow humans in the loop

3. Ubiquity: Web of Data & Other Contents May 2, 2011 Maestro Morricone will perform on the stage of the Smetana Hall to conduct the Czech National Symphony Orchestra and Choir. The concert will feature both Classical compositions and soundtracks such as the Ecstasy of Gold. In programme two concerts for July 14th and 15th. <html … May 2, 2011 Maestro Morricone <a rel="sameAs" resource="dbpedia…/Ennio_Morricone "/> … Smetana Hall … <span property="rdf:type" resource="yago:performance"> The concert will feature … <span property="event:date" content=" "> July 1

Why a Few Triples More? Dynamics: Where is the live data? Linkage: Where are the links in Linked Data? Ubiquity: Where are the paths between the Web-of-Data and the Web? Linked Data is great! But still in its infancy Need to add triples to capture further issues:

Outline Why More Triples: Dynamics, Linkage, Ubiquity Web-Scale Linkage Explain Title  Wrap-up Linkage & Ubiquity: Named-Entity Disambiguation 

Entities on the Web

Named-Entity Disambiguation (NED) Harry fought with you know who. He defeats the dark lord. 1) named-entity detection: segment & label by HMM or CRF (e.g. Stanford NER tagger) 2) co-reference resolution: link to preceding NP (trained classifier over linguistic features) 3) named-entity disambiguation: map each mention (name) to canonical entity (entry in KB) Three NLP tasks: Harry Potter Dirty Harry Lord Voldemort The Who (band) Prince Harry of England

Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films. Mentions, Meanings, Mappings D5 Overview May 30, 2011 Sergio means Sergio_Leone Sergio means Serge_Gainsbourg Ennio means Ennio_Antonelli Ennio means Ennio_Morricone Eli means Eli_(bible) Eli means ExtremeLightInfrastructure Eli means Eli_Wallach Ecstasy means Ecstasy_(drug) Ecstasy means Ecstasy_of_Gold trilogy means Star_Wars_Trilogy trilogy means Lord_of_the_Rings trilogy means Dollars_Trilogy … … … KB Eli (bible) Eli Wallach Mentions (surface names) Entities (meanings) Dollars Trilogy Lord of the Rings Star Wars Trilogy Benny Andersson Benny Goodman Ecstasy of Gold Ecstasy (drug) ?

Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films. Mention-Entity Graph Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy (drug) Eli (bible) Eli Wallach KB+Stats weighted undirected graph with two types of nodes Popularity (m,e): freq(e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) bag-of-words or language model: words, bigrams, phrases

Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films. Mention-Entity Graph Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy (drug) Eli (bible) Eli Wallach KB+Stats weighted undirected graph with two types of nodes Popularity (m,e): freq(e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) joint mapping

Mention-Entity Graph / 20 Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy(drug) Eli (bible) Eli Wallach KB+Stats weighted undirected graph with two types of nodes Popularity (m,e): freq(m,e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) Coherence (e,e‘): dist(types) overlap(links) overlap (anchor words) Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films.

Mention-Entity Graph / 20 KB+Stats weighted undirected graph with two types of nodes Popularity (m,e): freq(m,e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) Coherence (e,e‘): dist(types) overlap(links) overlap (anchor words) American Jews film actors artists Academy Award winners Metallica songs Ennio Morricone songs artifacts soundtrack music spaghetti westerns film trilogies movies artifacts Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy (drug) Eli (bible) Eli Wallach Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films.

Mention-Entity Graph / 20 KB+Stats weighted undirected graph with two types of nodes Popularity (m,e): freq(m,e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) Coherence (e,e‘): dist(types) overlap(links) overlap (anchor words) _the_Ugly Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy (drug) Eli (bible) Eli Wallach Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films.

Mention-Entity Graph / 20 KB+Stats Popularity (m,e): freq(m,e|m) length(e) #links(e) Similarity (m,e): cos/Dice/KL (context(m), context(e)) Coherence (e,e‘): dist(types) overlap(links) overlap (anchor words) Metallica on Morricone tribute Bellagio water fountain show Yo-Yo Ma Ennio Morricone composition The Magnificent Seven The Good, the Bad, and the Ugly Clint Eastwood University of Texas at Austin For a Few Dollars More The Good, the Bad, and the Ugly Man with No Name trilogy soundtrack by Ennio Morricone weighted undirected graph with two types of nodes Dollars Trilogy Lord of the Rings Star Wars Ecstasy of Gold Ecstasy (drug) Eli (bible) Eli Wallach Sergio talked to Ennio about Eli‘s role in the Ecstasy scene. This sequence on the graveyard was a highlight in Sergio‘s trilogy of western films.

Joint Mapping Build mention-entity graph or joint-inference factor graph from knowledge and statistics in KB Compute high-likelihood mapping (ML or MAP) or dense subgraph such that: each m is connected to exactly one e (or at most one e)

Coherence Graph Algorithm Compute dense subgraph to maximize min weighted degree among entity nodes such that: each m is connected to exactly one e (or at most one e) Greedy approximation: iteratively remove weakest entity and its edges Keep alternative solutions, then use local/randomized search [J. Hoffart et al.: EMNLP‘11]

Coherence Graph Algorithm Compute dense subgraph to maximize min weighted degree among entity nodes such that: each m is connected to exactly one e (or at most one e) Greedy approximation: iteratively remove weakest entity and its edges Keep alternative solutions, then use local/randomized search [J. Hoffart et al.: EMNLP‘11]

Coherence Graph Algorithm Compute dense subgraph to maximize min weighted degree among entity nodes such that: each m is connected to exactly one e (or at most one e) Greedy approximation: iteratively remove weakest entity and its edges Keep alternative solutions, then use local/randomized search [J. Hoffart et al.: EMNLP‘11]

Coherence Graph Algorithm Compute dense subgraph to maximize min weighted degree among entity nodes such that: each m is connected to exactly one e (or at most one e) Greedy approximation: iteratively remove weakest entity and its edges Keep alternative solutions, then use local/randomized search [J. Hoffart et al.: EMNLP‘11]

Named-Entity Disambiguation: State-of-the-Art Online tools: etc. Literature: Razvan Bunescu, Marius Pasca: EACL 2006 Silviu Cucerzan: EMNLP 2007 David Milne, Ian Witten: CIKM 2008 S. Kulkarni, A. Singh, G. Ramakrishnan, S. Chakrabarti: KDD 2009 G. Limaye, S. Sarawagi, S. Chakrabarti: VLDB 2010 Paolo Ferragina, Ugo Scaella: CIKM 2010 Mark Dredze et al.: COLING 2010 Johannes Hoffart et al.: EMNLP 2011 etc.

NED: Experimental Evaluation Benchmark: Extended CoNLL 2003 dataset: 1400 newswire articles originally annotated with mention markup (NER), now with NED mappings to Yago and Freebase difficult texts: … Australia beats India …  Australian_Cricket_Team … White House talks to Kreml …  President_of_the_USA … EDS made a contract with …  HP_Enterprise_Services Results: Best: AIDA method with prior+sim+coh + robustness test 82% recall, 87% mean average precision Comparison to other methods, see paper J. Hoffart et al.: Robust Disambiguation of Named Entities in Text, EMNLP

AIDA: Accurate Online Disambiguation

AIDA: Accurate Online Disambiguation

AIDA: Accurate Online Disambiguation

AIDA: Accurate Online Disambiguation

AIDA: Accurate Online Disambiguation

Interesting Research Issues More efficient graph algorithms (multicore, etc.) Allow mentions of unknown entities, mapped to null Short and difficult texts: tweets, headlines, etc. fictional texts: novels, song lyrics, etc. incoherent texts Disambiguation beyond entity names: coreferences: pronouns, paraphrases, etc. common nouns, verbal phrases (general WSD) Leverage deep-parsing structures, leverage semantic types

Why Named Entity Disambiguation is Key Linked data is best if it has many good links New & rich contents mostly in traditional Web Create sameAs links in (X)HTML contents, via RDFa Links for named entities give best mileage/effort Methods & tools greatly advanced & gradually maturing Keep human in the loop, embed NED in authoring tools

Outline Why More Triples: Dynamics, Linkage, Ubiquity Web-Scale Linkage Explain Title  Wrap-up Linkage & Ubiquity: Named-Entity Disambiguation  

Variants of NED at Web Scale How to run this on big batch of 1 Mio. input texts?  partition inputs across distributed machines, organize dictionary appropriately, …  exploit cross-document contexts How to deal with inputs from different time epochs?  consider time-dependent contexts, map to entities of proper epoch (e.g. harvested from Wikipedia history) How to handle Web-scale inputs (100 Mio. pages) restricted to a set of interesting entities? (e.g. tracking politicians and companies) Tools can map short text onto entities in a few seconds

owl:sameAs rdf.freebase.com/ns/ en.rome_ny owl:sameAs data.nytimes.com/ Coord geonames.org/ / city_of_rome N 43° 12' 46'' W 75° 27' 20'' dbpprop:citizenOf dbpedia.org/resource/ Rome rdf:type rdfs:subclassOf yago/ wordnet:Actor rdf:type rdfs:subclassOf yago/ wikicategory:ItalianComposer yago/ wordnet: Artist prop:actedIn imdb.com/name/nm / Linked RDF Triples on the Web prop: composedMusicFor imdb.com/title/tt / dbpedia.org/resource/ Ennio_Morricone referential data quality: automatic, dynamic, high coverage ! ? ? ?

Outline Why More Triples: Dynamics, Linkage, Ubiquity Web-Scale Linkage Explain Title  Wrap-up Linkage & Ubiquity: Named-Entity Disambiguation   

Summary Dynamics: (Deep-Web) sources  feeds, pub-sub, … ?  fresh & versioned triples Linkage: LOD  entity mapping  user  community Ubiquity: RDFa  entity disambiguation  authoring Linked Data is great! But it needs more triples to capture:

Outlook For a Few Triples More Challenge 1: generate high-quality sameAs links in RDFa & across all LOD sources For a Few Triples Less Challenge 2: add efficient top-k ranking to queries over RDF-in-context

Thank You !