{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:21Z","timestamp":1725544041963},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_3","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"12-23","source":"Crossref","is-referenced-by-count":6,"title":["Identifying Co-referential Names Across Large Corpora"],"prefix":"10.1007","author":[{"given":"Levon","family":"Lloyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Mehler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11575832_18","volume-title":"String Processing and Information Retrieval","author":"L. Lloyd","year":"2005","unstructured":"Lloyd, L., Kechagias, D., Skiena, S.: Lydia: A system for large-scale news analysis. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 161\u2013166. Springer, Heidelberg (2005)"},{"key":"3_CR2","first-page":"117","volume-title":"Computational Approaches to Analyzing Weblogs (AAAI-CAAW 2006)","author":"L. Lloyd","year":"2006","unstructured":"Lloyd, L., Kaulgud, P., Skiena, S.: Newspapers vs. blogs: Who gets the scoop? In: Computational Approaches to Analyzing Weblogs (AAAI-CAAW 2006), Technical Report SS-06-03, pp. 117\u2013124. AAAI Press, Menlo Park (2006)"},{"unstructured":"Kil, J., Lloyd, L., Skiena, S.: Question answering with lydia. In: 14th Text REtrieval Conference (TREC 2005) (2005)","key":"3_CR3"},{"doi-asserted-by":"crossref","unstructured":"Mehler, A., Bao, Y., Li, X., Wang, Y., Skiena, S.: Spatial analysis of news sources (submitted for publication, 2006)","key":"3_CR4","DOI":"10.1109\/TVCG.2006.179"},{"key":"3_CR5","first-page":"79","volume-title":"Proceedings of the Thirty-Sixth Annual Meeting of the Association for Computational Linguistics and Seventeenth International Conference on Computational Linguistics","author":"A. Bagga","year":"1998","unstructured":"Bagga, A., Baldwin, B.: Entity-based cross-document coreferencing using the vector space model. In: Boitet, C., Whitelock, P. (eds.) Proceedings of the Thirty-Sixth Annual Meeting of the Association for Computational Linguistics and Seventeenth International Conference on Computational Linguistics, pp. 79\u201385. Morgan Kaufmann, San Francisco (1998)"},{"doi-asserted-by":"crossref","unstructured":"Mann, G., Yarowsky, D.: Unsupervised personal name disambiguation. In: CoNLL, Edmonton, Alberta, Canada, pp. 33\u201340 (2003)","key":"3_CR6","DOI":"10.3115\/1119176.1119181"},{"doi-asserted-by":"crossref","unstructured":"Gooi, C., Allan, J.: Cross-document coreference on a large scale corpus. In: Human Language Technology Conf. North American Chapter Association for Computational Linguistics, Boston, Massachusetts, USA, pp. 9\u201316 (2004)","key":"3_CR7","DOI":"10.21236\/ADA458579"},{"doi-asserted-by":"crossref","unstructured":"Ng, V., Cardie, C.: Improving machine learning approaches to coreference resolution. In: 40th Annual Meeting of the Association for Computational Linguistics, Philadelphia, Pennsylvania, USA, pp. 104\u2013111 (2002)","key":"3_CR8","DOI":"10.3115\/1073083.1073102"},{"unstructured":"Bean, D., Riloff, E.: Unsupervised learning of contextual role knowledge for coreference resolution. In: Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Boston, Massachusetts, USA, pp. 297\u2013304 (2004)","key":"3_CR9"},{"doi-asserted-by":"crossref","unstructured":"Hernandez, M., Stolfo, S.: The merge\/purge problem for large databases. In: Proceedings of the 1995 ACM SIGMOD International Conference on the Management of Data, San Jose, California, USA, pp. 127\u2013138 (1995)","key":"3_CR10","DOI":"10.1145\/223784.223807"},{"doi-asserted-by":"crossref","unstructured":"Cohen, W., Richman, J.: Learning to match and cluster large high-dimensional data sets for data integration. In: Eighth ACM SIGKDD Conf. Knowledge Discovery and Data Mining, pp. 475\u2013480 (2002)","key":"3_CR11","DOI":"10.1145\/775107.775116"},{"issue":"12","key":"3_CR12","first-page":"39","volume":"7","author":"L. Philips","year":"1990","unstructured":"Philips, L.: Hanging on the Metaphone. Computer Language\u00a07(12), 39\u201343 (1990)","journal-title":"Computer Language"},{"doi-asserted-by":"crossref","unstructured":"Porter, M.: An algorithm for suffix stripping (1980), http:\/\/www.tartarus.org\/~martin\/PorterStemmer\/def.txt","key":"3_CR13","DOI":"10.1108\/eb046814"},{"unstructured":"Taft, R.: Name search techniques. New York State Identification and Intelligence Systems, Special Report No. 1, Albany, New York (1970)","key":"3_CR14"},{"issue":"7","key":"3_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/(SICI)1097-4571(199208)43:7<459::AID-ASI1>3.0.CO;2-D","volume":"43","author":"C. Borgman","year":"1992","unstructured":"Borgman, C., Siegfried, S.: Getty\u2019s synoname and its cousins: A survey of applications of personal name-matching algorithms. JASIS\u00a043(7), 459\u2013476 (1992)","journal-title":"JASIS"},{"key":"3_CR16","volume-title":"Computers and Intractability: A Guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)"},{"unstructured":"Karypis, G., Kumar, V.: METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices (2003), http:\/\/www-users.cs.umn.edu\/~karypis\/metis","key":"3_CR17"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:18Z","timestamp":1619493378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11780441_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}