ACL-OCL / Base_JSON /prefixS /json /S07 /S07-1030.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "S07-1030",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T15:23:08.770452Z"
},
"title": "FICO: Web Person Disambiguation Via Weighted Similarity of Entity Contexts",
"authors": [
{
"first": "Paul",
"middle": [],
"last": "Kalmar",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Fair Isaac Corporation",
"location": {
"addrLine": "3661 Valley Centre Dr. San Diego",
"postCode": "92130",
"region": "CA",
"country": "USA"
}
},
"email": "paulkalmar@fairisaac.com"
},
{
"first": "Matthias",
"middle": [],
"last": "Blume",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Fair Isaac Corporation",
"location": {
"addrLine": "3661 Valley Centre Dr. San Diego",
"postCode": "92130",
"region": "CA",
"country": "USA"
}
},
"email": "matthiasblume@fairisaac.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Entity disambiguation resolves the manyto-many correspondence between mentions of entities in text and unique real-world entities. Fair Isaac's entity disambiguation uses language-independent entity context to agglomeratively resolve mentions with similar names to unique entities. This paper describes Fair Isaac's automatic entity disambiguation capability and assesses its performance on the SemEval 2007 Web People Search task.",
"pdf_parse": {
"paper_id": "S07-1030",
"_pdf_hash": "",
"abstract": [
{
"text": "Entity disambiguation resolves the manyto-many correspondence between mentions of entities in text and unique real-world entities. Fair Isaac's entity disambiguation uses language-independent entity context to agglomeratively resolve mentions with similar names to unique entities. This paper describes Fair Isaac's automatic entity disambiguation capability and assesses its performance on the SemEval 2007 Web People Search task.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "We use the term entity to mean a specific person or object. A mention is a reference to an entity such as a word or phrase in a document. Taken together, all mentions that refer to the same realworld object model that entity (Mitchell et al. 2004) . Entity disambiguation inherently involves resolving many-to-many relationships. Multiple distinct strings may refer to the same entity. Simultaneously, multiple identical mentions refer to distinct entities (Bagga and Baldwin, 1998) .",
"cite_spans": [
{
"start": 225,
"end": 247,
"text": "(Mitchell et al. 2004)",
"ref_id": "BIBREF8"
},
{
"start": 457,
"end": 482,
"text": "(Bagga and Baldwin, 1998)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Fair Isaac's entity disambiguation software is based largely on language-independent algorithms that resolve mentions in the context of the entire corpus. The system utilizes multiple types of context as evidence for determining whether two mentions correspond to the same entity and it automatically learns the weight of evidence of each context item via corpus statistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The goal of the Web People Search task (Artiles et al. 2007) is to assign Web pages to groups, where each group contains all (and only those) pages that refer to one unique entity. A page is assigned to multiple groups if it mentions multiple entities, for example \"John F. Kennedy\" and the \"John F. Kennedy Library\". The pages were selected via a set of keyword queries, and the disambiguation is evaluated only on those query entities. This differs from Fair Isaac's system in a few key ways: our system deals with mentions rather than documents, our system does not require a filter on mentions, and our system is generally used for large collections of documents containing very many names rather than small sets of highly ambiguous documents dealing with one specific name. Nevertheless, it was possible to run the Fair Isaac entity disambiguation system on the Web People Search task data with almost no modifications and achieve accurate results.",
"cite_spans": [
{
"start": 39,
"end": 60,
"text": "(Artiles et al. 2007)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The remaining sections of this paper describe Fair Isaac's automatic entity disambiguation methodology and report on the performance of the system on the WePS data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In unstructured text, each document provides a natural context for entity disambiguation. After cleaning up extraneous markup we carry out within-document co-reference resolution, aggregating information about each entity mentioned in each document. We then use these entity attributes as features in determining which documents deal with the same entity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Methodology",
"sec_num": "2"
},
{
"text": "The first challenge in dealing with data from the Web is to decide which documents are useful and what text from those documents contains relevant information. As a first pass, the first HTML file in a folder which contained the query name was used as the main page. In retrospect, it might have been better to combine all portions of the page, or choose the longest page. We copied the title element and converted all text chunks to paragraphs, eliminating all other HTML and script. If no HTML was found in the directory for a page, the first text file which contained the query was used instead.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Dealing with Raw Web Data",
"sec_num": "2.1"
},
{
"text": "When dealing with unstructured text, a named entity recognition (NER) system provides the input to the entity disambiguation. Due to time constraints and that Persons are the entity type of primary interest, any mention that matches one of the query strings is automatically labeled as a Person, regardless of its actual type.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Within-Document Disambiguation",
"sec_num": "2.2"
},
{
"text": "As described in Blume (2005) , the system next carries out entity type-specific parsing in order to extract entity attributes such as titles, generate standardized names (e.g. p_abdul_khan_p for \"Dr. Abdul Q. Khan\"), and populate the data structures (token hashes) that are used to perform the withindocument entity disambiguation.",
"cite_spans": [
{
"start": 16,
"end": 28,
"text": "Blume (2005)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Within-Document Disambiguation",
"sec_num": "2.2"
},
{
"text": "We err on the side of not merging entities rather than incorrectly merging entities. Looking at multiple documents provides additional statistics. Thus, the cross-document disambiguation process described in the next section will still merge some entities even within individual documents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Within-Document Disambiguation",
"sec_num": "2.2"
},
{
"text": "Our cross-document entity disambiguation relies on one key insight: an entity can be distinguished by the company it keeps. If Abdul Khan 1 associates with different people and organizations at different locations than Abdul Khan 2, then he is probably a different person. Furthermore, if it is possible to compare two entities based on one type of context, it is possible to compare them based on every type of context.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "Within each domain, we require a finite set of context items. In the domains of co-occurring locations, organizations, and persons, these are the standardized names derived in the entity information extraction phase of within-document disambiguation. We use the logarithm of the inverse name frequency (the number of standard person names with which this context item appears), INF, as a weight indicating the salience of each context item. Co-occurrence with a common name provides less indication that two mentions correspond to the same entity than co-occurrence with an uncommon name. To reduce noise, only entities that occur within a given window of entities are included in this vector. In all test runs, this window is set to 10 entities on either side. Because of the effects that small corpora have on statistics, we added a large amount of newswire text to improve frequency counts. Many of the query names would have low frequency in a text corpus that is not about them specifically, but have high frequency in this task because each document contains at least one mention of them. This would cause the INF weight to incorrectly estimate the importance of any token; adding additional documents to the disambiguation run reduces this effect and brings frequency counts to more realistic levels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "We similarly count title tokens that occur with the entity and compute INF weights for the title tokens. Topic context, as described in Blume (2005) , was used in some post-submission runs.",
"cite_spans": [
{
"start": 136,
"end": 148,
"text": "Blume (2005)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "We define a separate distance measure per context domain. We are able to discount the cooccurrence with multiple items as well as quantify an unexpected lack of shared co-occurrence by engineering each distance measure for each specific domain. The score produced by each distance measure may be loosely interpreted as the log of the likelihood of two randomly generated contexts sharing the observed degree of similarity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "In addition to the context-based distance measures, we utilize a lexical (string) distance measure based on exactly the same transformations as used to compare strings for intra-document entity disambiguation plus the Soundex algorithm (Knuth 1998) to measure whether two name tokens sound the same. A large negative score indicates a great deal of similarity (log likelihood).",
"cite_spans": [
{
"start": 236,
"end": 248,
"text": "(Knuth 1998)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "The process of cross-document entity disambiguation now boils down to repeatedly finding a pair of entities, comparing them (computing the sum of the above distance measures), and merging them if the score exceeds some threshold. We compute sets of keys based on lexical similarity and compare only entities that are likely to match. The WePS evaluation only deals with entities that match a query. Thus, we added a new step of key generation based on the query.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-Document Disambiguation",
"sec_num": "2.3"
},
{
"text": "We have tested our entity disambiguation system on several semi-structured and unstructured text data sets. Here, we report the performance on the training data provided for the Web People Search task. This corpus consists of raw Web pages with substantial variation in capitalization, punctuation, grammar, and spelling -characteristics that make NER challenging. A few other issues also negatively impact our performance, including extraneous text, long lists of entities, and the issue of finding the correct document to parse.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "The NER process identified a ratio of approximately 220 mentions per document across 3,359 documents. Within-document entity disambiguation reduced this to approximately 113 entities per document, which we refer to as document-level entities. Of these, 3,383 Persons (including those Organizations and Locations which were relabeled as Persons) contained a query name. Crossdocument entity disambiguation reduced this to 976 distinct persons with 721 distinct standardized names. Thus, 2,407 merge operations were performed in this step. On average, there are 48 mentions per query name. Our system found an average of 14 unique entities per query name. In the gold standard, the average is 9 unique entities per query name.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "Looking at the names that matched in the output, it is clear that NER is very important to the process. Post submission of our initial run, we used proper tokenization of punctuation and an additional NER system, which corrected many mistakes in the grouping of names. Also, many of the names that were incorrectly merged would not have been compared if not for the introduction of the additional key that compares all mentions that match a query name.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "For the WePS evaluation submission, we converted our results to document-level entities by mapping each mention to the document that it was part of and removing duplicates. If we did not find a mention in a document, we labeled the document as a singleton entity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "We also used a number of standard metrics for our internal evaluation. Most of these operate on document-level entities rather than on documents. To convert the ground truth provided for the task to a form usable for these metrics, we assume that each entity contains all mentions in the corre-sponding document group. These metrics test the cross-document disambiguation rather than the NER and within-document disambiguation. These metrics should not be used to compare between different versions of NER and within-document disambiguation, since the ground truth used in the evaluation is generated by these processes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "In Table 1 , we compare a run with the additional newswire data and the comparison key (our WePS submission), leaving out the additional newswire data and the additional comparison key, and leaving out only the additional comparison key.",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "In Table 2 , we compare runs based on the improved NER (available only after the WePS submission deadline). The first uses the same parameters as our submission, the second uses an increased threshold, and the third utilizes the word vector-based clustering (document topics).",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "Acc. Table 2 . Results based on improved named entity recognition. These should not be directly compared against those in Table 1 , since the different NER yields different ground truth for these evaluation metrics.",
"cite_spans": [],
"ref_spans": [
{
"start": 5,
"end": 12,
"text": "Table 2",
"ref_id": null
},
{
"start": 122,
"end": 129,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "Most of our metrics are based on pairwise comparisons -all document-level entities are compared against all other document-level entities that match the same query name, noting whether the pair was coreferent in the results and in the ground truth. With such comparison, we obtain measures including precision, recall, and accuracy. In this training data, depending on which NER is used, 35,000-50,000 pairwise comparisons are possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "We also define a clusterwise measure of the harmonic mean between purity and inverse purity with respect to mentions. This is different from the metric provided by WePS, purity and inverse pu-rity at the document level. Since some documents contain multiple entities, the latter metric does not perform correctly. Mentions, on the other hand, are always unique in our disambiguation. However, because the ground truth was specified at the document level, documents containing multiple entities that match a query yield ambiguous mentions. These decrease all purity-related scores equally and do not vary between runs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "The addition of the newswire data improved results. Inclusion of an extra comparison based on query name matches allowed for comparison of entities with names that do not match the format of person names, and only slightly reduced overall performance. The new NER run can only be compared on the last three runs. to the system performs better with topic context than without it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "In comparison, in the 2005 Knowledge Discovery and Dissemination (KD-D) Challenge Task ER-1a (the main entity disambiguation task), we achieved an accuracy of 94.5%. The margin of error in the evaluation was estimated at 3% due to errors in the \"ground truth\". This was a pure disambiguation task with no NER or name standardization required. The evaluation set contained 100 names, 9027 documents, and 583,152 pair-wise assertions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Performance",
"sec_num": "3"
},
{
"text": "Although the primary purposes of Fair Isaac's entity disambiguation system differ from the goal of the Web People Search task, we found that with little modification it was possible to fairly accurately cluster Web pages with a given query name according to the real-world entities mentioned on the page. Most of the errors that we encountered are related to information extraction from unstructured data as opposed to the cross-document entity disambiguation itself.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "4"
}
],
"back_matter": [
{
"text": "This material is based upon work supported by the Defense Advanced Research Projects Agency (DARPA) under Contract No. HR0011-06-C-0023.Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Defense Advanced Research Projects Agency (DARPA).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgment",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "The Se-mEval-2007 WePS Evaluation: Establishing a benchmark for the Web People Search Task",
"authors": [
{
"first": "J",
"middle": [],
"last": "Artiles",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Gonzalo",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Sekine",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of Semeval",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Artiles, J., Gonzalo, J. and Sekine, S. (2007). The Se- mEval-2007 WePS Evaluation: Establishing a bench- mark for the Web People Search Task. In Proceed- ings of Semeval 2007, Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Entity-based Crossdocument Coreferencing Using the Vector Space Model",
"authors": [
{
"first": "A",
"middle": [],
"last": "Bagga",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": 1998,
"venue": "th International Conference on Computational Linguistics (CoLing-ACL)",
"volume": "17",
"issue": "",
"pages": "79--85",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bagga, A. and Baldwin, B. (1998). Entity-based Cross- document Coreferencing Using the Vector Space Model. 17 th International Conference on Computa- tional Linguistics (CoLing-ACL). Montreal, Canada. 10-14 August, 1998, 79-85.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Automatic Entity Disambiguation: Benefits to NER, Relation Extraction",
"authors": [
{
"first": "M",
"middle": [],
"last": "Blume",
"suffix": ""
},
{
"first": "C",
"middle": [
"H"
],
"last": "Gooi",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Allan",
"suffix": ""
}
],
"year": 2004,
"venue": "Cross-Document Coreference on a Large Scale Corpus. Human Language Technology Conference (HLT-NAACL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Blume, M. (2005). Automatic Entity Disambiguation: Benefits to NER, Relation Extraction, Link Analysis, and Inference. 1 st International Conference on Intel- ligence Analysis. McLean, Virginia. 2-5 May, 2005. Gooi, C. H. and Allan, J. (2004). Cross-Document Coreference on a Large Scale Corpus. Human Lan- guage Technology Conference (HLT-NAACL).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A Probabilistic Model for Entity Disambiguation Using Relationships",
"authors": [
{
"first": "D",
"middle": [
"V"
],
"last": "Kalashnikov",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Mehrotra",
"suffix": ""
}
],
"year": 2005,
"venue": "SIAM International Conference on Data Mining (SDM)",
"volume": "",
"issue": "",
"pages": "21--23",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kalashnikov, D. V. and Mehrotra, S. (2005). A Prob- abilistic Model for Entity Disambiguation Using Re- lationships. SIAM International Conference on Data Mining (SDM). Newport Beach, California. 21-23",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "The Art of Computer Programming",
"authors": [
{
"first": "D",
"middle": [
"E"
],
"last": "Knuth",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "3",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Knuth, D. E. (1998). The Art of Computer Program- ming, Volume 3: Sorting and Searching. Addison- Wesley Professional.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Unsupervised Personal Name Disambiguation",
"authors": [
{
"first": "G",
"middle": [
"S"
],
"last": "Mann",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 2003,
"venue": "Conference on Computational Natural Language Learning (CoNLL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mann, G. S. and Yarowsky, D. (2003). Unsupervised Personal Name Disambiguation. Conference on Computational Natural Language Learning (CoNLL).",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Annotation Guidelines for Entity Detection and Tracking (EDT)",
"authors": [
{
"first": "A",
"middle": [],
"last": "Mitchell",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Strassel",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Przybocki",
"suffix": ""
},
{
"first": "J",
"middle": [
"K"
],
"last": "Davis",
"suffix": ""
},
{
"first": "G",
"middle": [],
"last": "Doddington",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Grishman",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Meyers",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Brunstein",
"suffix": ""
},
{
"first": "L",
"middle": [],
"last": "Ferro",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Sundheim",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mitchell, A.; Strassel, S.; Przybocki, P.; Davis, J. K.; Doddington, G.; Grishman, R.; Meyers, A.; Brun- stein, A.; Ferro, L. and Sundheim, B. (2004). Anno- tation Guidelines for Entity Detection and Tracking (EDT), Version 4.2.6. http://www.ldc.upenn.edu/Projects/ACE/.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Is Hillary Rodham Clinton the President? Disambiguating Names across Documents",
"authors": [
{
"first": "Y",
"middle": [],
"last": "Ravin",
"suffix": ""
},
{
"first": "Z",
"middle": [],
"last": "Kazi",
"suffix": ""
}
],
"year": 1999,
"venue": "Workshop on Coreference and Its Applications",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ravin, Y. and Kazi, Z. (1999). Is Hillary Rodham Clin- ton the President? Disambiguating Names across Documents. ACL 1999 Workshop on Coreference and Its Applications. College Park, Maryland. 22",
"links": null
}
},
"ref_entries": {}
}
}