<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="402"/><title>UNN-WePS: Web Person Search using co-Present Names and Lexical Chains</title><pubinfo>Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007),pages 402-405, Prague, June 2007. ©2007 Association for Computational Linguistics</pubinfo><author surname="Ellman" givenname="Jeremy"><org  name="Northumbria University" country="United Kingdom" city="Newcastle upon Tyne"/></author><author surname="Emery" givenname="Gary"><org  name="Northumbria University" country="United Kingdom" city="Newcastle upon Tyne"/></author></firstpageheader><frontmatter><p><b>UNN-WePS: Web Person Search using co-Present Names</b></p><p><b>and Lexical Chains</b></p><p><b>Jeremy Ellman</b></p><p>Northumbria University Pandon Building Newcastle upon Tyne UK</p><p>Jeremy.  Ellman ©unn.ac.uk</p><p><b>Gary Emery</b></p><p>Northumbria University</p><p>Pandon Building Newcastle upon Tyne</p><p>UK</p><p>Gary.Emery@unn.ac.uk</p></frontmatter><abstract>We describe a system, UNN-WePS for identifying individuals from web pages us­ing data from Semeval Task 13. Our sys­tem is based on using co-presence of per­son names to form seed clusters. These are then extended with pages that are deemed conceptually similar based on a lexical chaining analysis computed using Roget's thesaurus. Finally, a single link hierarchical agglomerative clustering algorithm merges the enhanced clusters for individual entity recognition. UNN-WePS achieved an aver­age purity of 0.6, and inverse purity of 0.73. </abstract></header><body><section number="1" title="Introduction"><p>Guha and Garg (2004) report that approximately 4% of internet searches are to locate named indi­viduals. Yet, many people share the same name with for example 157630 individuals in the UK sharing the most common name 'David Jones' (UK statistics cited by Ash 2006). Consequently identifying web pages on specific individuals is a significant problem that will grow as everyone ac­quires a web presence.</p><p>There are several proposed approaches to identi­fying which individuals correspond to which web pages. For example, Bollegala et al. (2007) pro­pose augmenting queries in the style of relevance feedback (Salton and Buckley 1990), Kalashnikov (2007) treat Web Person Search (WePS) as a dis­ambiguation problem whose objective is to distin­guish individuals, whilst Wan et al. (2005) see WePS as a clustering problem.</p><p>WePS has both similarities and differences to word sense disambiguation (WSD). Both seek to classify instances of usage, but in WSD the sense inventory is fixed. WSD then is more amenable to a classification solution where a system can be ef­fectively trained using learning algorithms. In WePS we do not know from the outset how many individuals our pages correspond to. Consequently we took the view that WePS is better seen as a clustering rather than a classification problem.</p><subsection number="1.1" title="Ambiguity"><p>Ambiguity is a common feature of WePS and WSD. There are multiple types of ambiguity in the relation between person names and entities that confound overly simple approaches. Firstly, note that some first names are also last names (Les Paul, Michael Howard), and that some last names also occur as given names (Woodrow Wilson Guthrie, Martin Luther King). Consequently, an overly simple name parser will easily be confused. Sec­ondly many last names are also place names (Jack London, William Manchester). Thus, if a last name is not found in the names database, but is found in the gazetteer, a name can be confused with a loca­tion. Finally, we come to toponym ambiguity, where the name of a place may correspond to sev­eral locations. (For example, there are thirteen places called Manchester, multiple Londons, Washingtons etc.) Resolving toponyms is a re­search problem itself (Leidner, 2004).</p></subsection><subsection number="1.2" title="Statistics"><p>Statistics are a further relation between WePS and WSD. We expect Zipf s law (e.g. Adamic and Huberman 2002) to apply to the relation between web pages and individuals, meaning that relative frequency and rank form a harmonic series.<page local="2" global="403"/> In other words some people will be associated with many pages and increasingly more will be linked to fewer. This has a strong link to disambiguation, where an inaccurate algorithm may give inferior performance to the strategy of always selecting the most frequent sense.</p><p>Now if we consider the types of data that distin­guish individuals, we might find colleagues, friends, and family mentioned in web pages, in addition to locations, dates, and topics of interest. Of these, names are particularly useful, and we define co-present names as names found in a web page in addition to the name for which we are searching.</p><p>Names are statistically useful, even though many people share the same name. For example there are 7640 individuals in the UK (for example) that share the most popular female name "Margaret Smith". Given the population of the UK is ap­proximately 60 million, the probability of even the most common female name in the UK occurring randomly is 1.27+10-4 (of course not all the indi­viduals have web pages).</p><p>Now, Semeval WePS pages (Artiles 2007) have been retrieved in response to a search for one name. Often such web pages will contain addi­tional names. The probability that a web page will contain two names corresponding to two different individuals is quite low (~ca 7x10-8). Conse­quently co-present names form indicators of an individual's identity. These give accurate seed points, which are critical to the success of many clustering algorithms such as k-means (Jain et al.</p><doubt alpha="0.0" length="5" tooSmall="False" monospace="0.0">1999)</doubt></subsection><subsection number="1.3" title="Lexical Chain Text Similarity"><p>Not all WePS pages contain multiple names, or even content in any form. Consequently we need to distinguish between pages that are similar in mean­ing to a page already in a seed cluster, those that refer to separate entities, and those to be discarded This was done by comparing the conceptual similarity of the WePS pages using Roget's thesau­rus as the conceptual inventory. The approach was described in Ellman (2000), where lexical chains are identified from each document using Roget's thesaurus. These chains are then unrolled to yield an attribute value vector of concepts where the values are given by repetition, type of thesaural relation found, and textual cohesion. Thus, we are not simply indexing by thesaural categories.</p><p>Vectors corresponding to different documents can be compared to give a measure of conceptual similarity. Roget's thesaurus typically contains one thousand sense entries divided by part of speech usage, giving a total of 6400 entries. Such vectors may be compared using many algorithms, although a nearest neighbor algorithm was implemented in</p><p>Ellman (2000).</p></subsection><subsection number="1.4" title="One Sense Per Discourse"><p>UNN-WePS was based on a deliberate strategy that the success of an active disambiguation method needed to exceed its overall error rate in order to improve baseline performance. As such, simple methods that improved overall success modestly were preferred to complex ones that did not. Consequently, to reduce the search space, we used the 'one sense per discourse' heuristic (Gale et al. 1992). This assumes that one web page would not refer to two different individuals that share a name.</p></subsection></section><section number="2" title="System Description"><p>UNN-WePS was made up of three components, comprising modules to:</p><p>1. Create seed clusters that associated files with person names other than those being searched for.</p><p>2. Match similarity of unallocated documents to micro clusters using lexical chains de­rived from Roget's thesaurus.</p><p>3. Identify entities using single link agglom-erative clustering algorithm.</p><p>In detail, a part of speech tagger (Coburn et al. 2007) was used to identify sequences of proper nouns. Person names were identified from these sequences using the following simple names 'grammar' coupled with data from the US Census (1990).</p><doubt alpha="60.8" length="51" tooSmall="False" monospace="0.0">I   Name = |Title*][Initials | 1stname]+[2ndname]*I</doubt><figure caption="Figure 1: Regular Expression Name Syntax"></figure><p>We also used a gazetteer to forms seed clusters using data from the World Gazetteer (2007). This did not form part of the submitted system.</p><page local="3" global="404"/><p>In the second step, conceptual similarity was de­termined using the method and tool described in Ellman (2000). Documents not allocated to seed clusters, were compared for conceptual similarity to all other documents. If similar to a document in a seed cluster, the unallocated document was in­serted into the seed cluster. If neither document nor one to which it was similar too were in a seed clus­ter, they were formed into a new seed cluster. Fi­nally if document has 'meaningful' content, but is not conceptually similar to any other it is stored in a singleton seed cluster otherwise, it is discarded.</p><p>In the final step, seed clusters were sorted by size and merged using a single link hierarchical agglomerative clustering algorithm to identify enti­ties (Jain et al. 1999). The use of a single link means that a document can only be associated with one entity, which conforms to the 'one sense per discourse' heuristic.</p><p>Further details of the UNN-WePS algorithm are given in figure 2 below.</p></section><section number="3" title="Results"><p>UNN-WePS achieved an average purity of 0.6, and inverse purity of 0.73 in Semeval Task 13, achiev­ing seventh position out of sixteen competing sys­tems (Artiles et al. 2007). However there was con­siderable variance in UNN-WePS results as shown in graph 1 below.</p><p><b>Graph 1: UNN-WePS purity performance</b></p><p>Graph 1 shows the purity scores for UNN-WePS on the Semeval 13 test data on three conditions: (1) as submitted (solid line), (2) using the gazetteer (dashed line), and (3) without the lexical chain based similarity matching (dotted line).</p><p>Note although the purity is lower when similar­ity matching is included the number of discarded documents is approximately halved.</p><p>An examination of the data suggests that where performance was especially poor it was due to ge­nealogical data. Firstly this contains multiple indi­viduals sharing the same name violating the 'one sense per discourse' heuristic. Secondly genealogi­cal data includes birth and death information which was outside the scope of UNN-WePS. Further­more, the large number of names confounds the statistical utility of co-present names.</p></section><section number="4" title="Conclusion and Future Work"><p>We have described a system, UNN-WePS that dis-ambiguates individuals in web pages as required for Semeval task 13 (Artiles et al. 2007).</p><p>UNN-WePS was composed of three modules. The first formed seed clusters based on names pre­sent in web pages other than the individual for whom we are searching. The second used a lexical chain based similarity measure to associates re­maining files with clusters, whilst the third joined the clusters to identify identities using a single link hierarchical algorithm.<page local="4" global="405"/></p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Purity Vs Name</b></p><p><i>i___</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>0.8 -0.6 -0.4 -0.2 -</p><p>0</p></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Martha_Edwards James_Morehead " Violet_Howard ~_ James_Curran Karen_Peterson Thomas_Kirk " Mark_Johnson Stephen_C ark Alvin_Cooper Harry_Hughes Arthur_Morgan Jude_Brown Jerry_Hobbs ~_ Chris_Brockett Sharon_Goldwater</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table caption="Figure 2: UNN-WePS Algorithm" class="main" frame="box" rules="all" border="1" regular="True"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Foreach Person_Name</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1.</p></td><td class="cell"><p>Tag raw html Files with Part of Speech.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>2.</p></td><td class="cell"><p>Identify Generic Document Profiles using</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>lexical chains in html Files.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>3.</p></td><td class="cell"><p>Construct table T to associate person</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>names with Files.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>a.   Foreach File in Person_Name</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>i. Identify Names in File</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>ii. Foreach Name in Names</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>If Name * Person_Name</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Store Name, File in T</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>4.</p></td><td class="cell"><p>Create Seed clusters by inverting T to</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>give files that are associated by co-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>present names</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>5.</p></td><td class="cell"><p>match Similarity of unallocated docu-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>ments to seed clusters</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>a. Foreach unallocated document D</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>If similar to a document in cluster C</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>insert D into C</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p><b>else if </b>similar to a non-clustered</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>document D'</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Create D, D' as new cluster C'</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p><b>else if </b>contains D &gt; 200 words</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Create D as new cluster C''</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>else discard D</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>6.</p></td><td class="cell"><p>Identify entities using single link ag-</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>glomerative clustering algorithm over</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>seed clusters.</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p>UNN-WePS performed surprisingly well con­sidering the simplicity of its basic seeding algo­rithm. The use however of the 'one sense per dis­course' heuristic was flawed. Names do re-occur across generations in families.</p><p>Genealogy is a popular Internet pastime, and web pages containing genealogy data frequently refer to multiple individuals that share a name at different time periods. As UNN-WePS did not ac­count for time, this could not be detected. Further­more, the large number of names in on-line genea­logical data does lead to spurious associations.</p><p>As WePS was time limited, several extensions and refinements were envisaged, but not executed. Firstly, as described, the world gazetteer (2007) did not lead to performance improvements. We speculate therefore the disambiguation effect from using place names was exceeded by the ambiguity introduced by using them blindly. We note espe­cially the inference between unidentified names (or street names, or building names) being interpreted as place data.</p><p>A further system deficiency was the lack of rec­ognition of date data. This is essential to differenti­ate between identically named individuals in ge­nealogical data.</p><p>Finally, we are currently experimenting with dif­ferent clustering algorithms using the CLUTO toolkit (Karypis 2002) to improve on UNN-WePS baseline performance.</p></section><references><doubt alpha="60.9" length="92" tooSmall="False" monospace="0.0">Adamic L.A. and Huberman B.A., 2002Zipfs law and the Internet, Glottometrics3, 2002, 143-150</doubt><p>Artiles, J., Gonzalo, J. and Sekine, S. (2007).</p><p><i>The SemEval-2007 WePSEvaluation: Establishing a benchmark for the Web People Search Task. </i>In Pro­ceedings of Semeval 2007, Association for Computa­tional Linguistics.</p><p>Ash, Russell 2006 <i>The top 10 of Everything </i>Hamlyn,</p><p>Palazzo Bath UK</p><p>Bollegala, Danushka, Matsuo Yutaka Ishizuka Mitsuru <i>Disambiguating Personal Names on the Web using Automatically Extracted Key Phrases </i>Proc. ECAI 2006, pp.553-557, Trento, Italy (2006.8)</p><p>Coburn A, Ceglowski M, and Cuadrado J 2007 <i>Lingua:</i><i>:EN::Tagger, a Perl part-of-speech tagger for English text. </i>http://search.cpan.org/~acoburn/ Lingua-EN-Tagger-0.13/</p><p>Ellman, Jeremy. 2000 <i>Using Roget's Thesaurus to De­termine the Similarity of Texts. </i>PhD thesis, Univer­sity of Sunderland [Available at http://citeseer.ist.psu.edu/ellman00using.html ]</p><p>Gale, W., Church, K., and Yarowsky, D. (1992). <i>One sense per discourse. </i>In Proceedings of the Fourth DARPA Speech and Natural Language Workshop, pages 233--237.</p><p>Guha R. &amp; Garg A. <i>Disambiguating People in Search.</i></p><p>Stanford University, 2004</p><doubt alpha="50.4" length="119" tooSmall="False" monospace="0.0">Jain, A. K., Murty, M. N., and Flynn, P. J. 1999.Data clustering: a review.ACM Comput. Surv. 31, 3 (Sep. 1999), 264-323</doubt><p>Karypis G. 2002. <i>CLUTO: A clustering toolkit. </i>Techni­cal Report 02-017, University of Minnesota. Avail­able at: http://wwwusers.cs.umn.edu/~karypis/cluto/.</p><p>Leidner, Jochen L. (2004). <i>Toponym Resolution in Text: "Which Sheffield is it?" </i>in proc. 27th Annual Interna­tional ACM SIGIR Conference (SIGIR 2004), Shef­field, UK.</p><p>Navigli, Roberto 2006. <i>Meaningful clustering of senses helps boost word sense disambiguation performance. </i>In <i>Proc. ACL </i>(Sydney, Australia, July 17 - 18, 2006).</p><p>Salton and Buckley 1990 <i>Improving Retrieval Perform­ance by Relevance Feedback </i>JASIS 41(4) pp288-297 genealogy/names/namesfiles.html accessed 17th</p><doubt alpha="66.7" length="36" tooSmall="False" monospace="0.0">US Census 1990http://www.census.gov/</doubt><doubt alpha="50.0" length="10" tooSmall="False" monospace="0.0">April 2007</doubt><doubt alpha="65.2" length="138" tooSmall="False" monospace="0.0">Wan, X., Gao, J., Li, M., and Ding, B. 2005.Person resolution in person search results: WebHawk.in Proc. CIKM '05. ACM Press, New York, NY</doubt><p>World Gazetteer 2007 http://world-gazetteer.com/ ac­cessed 17th April 2007</p></references></body></article>