{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:57Z","timestamp":1759063677825,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T00:00:00Z","timestamp":1459987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2016,4,7]]},"abstract":"<jats:p>\n            The population of a predefined relational schema from textual content, commonly known as Information Extraction (IE), is a pervasive task in contemporary computational challenges associated with Big Data. Since the textual content varies widely in nature and structure (from machine logs to informal natural language), it is notoriously difficult to write IE programs that unambiguously extract the sought information. For example, during extraction, an IE program could annotate a substring as both an address and a person name. When this happens, the extracted information is said to be\n            <jats:italic>inconsistent<\/jats:italic>\n            , and some way of removing inconsistencies is crucial to compute the final output. Industrial-strength IE systems like GATE and IBM SystemT therefore provide a built-in collection of\n            <jats:italic>cleaning<\/jats:italic>\n            operations to remove inconsistencies from extracted relations. These operations, however, are collected in an ad hoc fashion through use cases. Ideally, we would like to allow IE developers to declare their own policies. But existing cleaning operations are defined in an algorithmic way, and hence it is not clear how to extend the built-in operations without requiring low-level coding of internal or external functions.\n          <\/jats:p>\n          <jats:p>\n            We embark on the establishment of a framework for declarative cleaning of inconsistencies in IE through principles of database theory. Specifically, building upon the formalism of\n            <jats:italic>document spanners<\/jats:italic>\n            for IE, we adopt the concept of\n            <jats:italic>prioritized repairs<\/jats:italic>\n            , which has been recently proposed as an extension of the traditional database repairs to incorporate priorities among conflicting facts. We show that our framework captures the popular cleaning policies, as well as the POSIX semantics for extraction through regular expressions. We explore the problem of determining whether a cleaning declaration is unambiguous (i.e., always results in a single repair) and whether it increases the expressive power of the extraction language. We give both positive and negative results, some of which are general and some of which apply to policies used in practice.\n          <\/jats:p>","DOI":"10.1145\/2877202","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T22:16:10Z","timestamp":1460067370000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Declarative Cleaning of Inconsistencies in Information Extraction"],"prefix":"10.1145","volume":"41","author":[{"given":"Ronald","family":"Fagin","sequence":"first","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederick","family":"Reiss","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stijn","family":"Vansummeren","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,4,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488394"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3115\/1119089.1119095"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303983"},{"key":"e_1_2_1_4_1","unstructured":"Edward Benson Aria Haghighi and Regina Barzilay. 2011. Event discovery in social media feeds. In ACL. 389--398.   Edward Benson Aria Haghighi and Regina Barzilay. 2011. Event discovery in social media feeds. In ACL. 389--398."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9402-7"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0316-z"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456650.1456651"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989479"},{"key":"e_1_2_1_10_1","unstructured":"Laura Chiticariu Rajasekar Krishnamurthy Yunyao Li Sriram Raghavan Frederick Reiss and Shivakumar Vaithyanathan. 2010. SystemT: An algebraic approach to declarative information extraction. In ACL. 128--137.   Laura Chiticariu Rajasekar Krishnamurthy Yunyao Li Sriram Raghavan Frederick Reiss and Shivakumar Vaithyanathan. 2010. SystemT: An algebraic approach to declarative information extraction. In ACL. 128--137."},{"volume-title":"Reiss","year":"2013","author":"Chiticariu Laura","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","unstructured":"Rus Cox. 2009. Regular Expression Matching: the Virtual Machine Approach. Digression: POSIX Submatching. Retrieved from http:\/\/swtch.com\/ rsc\/regexp\/regexp2.html.  Rus Cox. 2009. Regular Expression Matching: the Virtual Machine Approach. Digression: POSIX Submatching. Retrieved from http:\/\/swtch.com\/ rsc\/regexp\/regexp2.html."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014348124664"},{"volume-title":"JAPE: A Java Annotation Patterns Engine","year":"2000","author":"Cunningham H.","key":"e_1_2_1_14_1"},{"volume-title":"Strategies for Natural Language Processing, Wendy G","author":"DeJong Gerald","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556564"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989322"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594540"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699442"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376940"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0206-6"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989373"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1351324904003523"},{"volume-title":"An interpreation of the POSIX Regex Standard","year":"2003","author":"Fowler Glenn","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3115\/980845.980914"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.60"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.3115\/992628.992709"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.1.9"},{"volume-title":"The Open Group Base Specifications Issue 7. (2013)","year":"2013","author":"Institute of Electrical and Electronic Engineers and The Open Group. 2013.","key":"e_1_2_1_29_1"},{"volume-title":"Pereira","year":"2001","author":"Lafferty John D.","key":"e_1_2_1_30_1"},{"volume-title":"Efficient Submatch Addressing for Regular Expressions. Master\u2019s thesis","author":"Laurikari Ville","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","unstructured":"T. R. Leek. 1997. Information Extraction Using Hidden Markov Models. Master\u2019s thesis. UC San Diego.  T. R. Leek. 1997. Information Extraction Using Hidden Markov Models. Master\u2019s thesis. UC San Diego."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920916"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.11.002"},{"volume-title":"Pereira","year":"2000","author":"McCallum Andrew","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"e_1_2_1_37_1","volume-title":"Michael Domaratzki and Kai Salomaa (Eds.)","volume":"6482","author":"Okui Satoshi","year":"2010"},{"volume-title":"Joint inference in information extraction","author":"Poon Hoifung","key":"e_1_2_1_38_1"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497502"},{"key":"e_1_2_1_40_1","unstructured":"Ellen Riloff. 1993. Automatically constructing a dictionary for information extraction tasks. In AAAI. 811--816.   Ellen Riloff. 1993. Automatically constructing a dictionary for information extraction tasks. In AAAI. 811--816."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465284"},{"key":"e_1_2_1_42_1","unstructured":"Warren Shen AnHai Doan Jeffrey F. Naughton and Raghu Ramakrishnan. 2007. Declarative information extraction using datalog with embedded extraction predicates. In VLDB. 1033--1044.   Warren Shen AnHai Doan Jeffrey F. Naughton and Raghu Ramakrishnan. 2007. Declarative information extraction using datalog with embedded extraction predicates. In VLDB. 1033--1044."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007562322031"},{"volume-title":"Lehnert","year":"1995","author":"Soderland Stephen","key":"e_1_2_1_44_1"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-012-9288-8"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133651.1133652"},{"key":"e_1_2_1_47_1","first-page":"19","article-title":"Application of information technology: MedEx: A medication information extraction system for clinical narratives","volume":"17","author":"Xu Hua","year":"2010","journal-title":"JAMIA"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242639"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2877202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2877202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:10Z","timestamp":1750221550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2877202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,7]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4,7]]}},"alternative-id":["10.1145\/2877202"],"URL":"https:\/\/doi.org\/10.1145\/2877202","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2016,4,7]]},"assertion":[{"value":"2015-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}