{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:37:58Z","timestamp":1757450278021,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_1","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Information Extraction Framework of\u00a0Document Spanners - A Very Informal Survey"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5137-1504","authenticated-orcid":false,"given":"Markus L.","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/3422648.3422655","volume":"49","author":"A Amarilli","year":"2020","unstructured":"Amarilli, A., Bourhis, P., Mengel, S., Niewerth, M.: Constant-delay enumeration for nondeterministic document spanners. SIGMOD Rec. 49(1), 25\u201332 (2020). https:\/\/doi.org\/10.1145\/3422648.3422655","journal-title":"SIGMOD Rec."},{"doi-asserted-by":"publisher","unstructured":"Amarilli, A., Bourhis, P., Mengel, S., Niewerth, M.: Constant-delay enumeration for nondeterministic document spanners. ACM Trans. Database Syst. 46(1), 2:1\u20132:30 (2021). https:\/\/doi.org\/10.1145\/3436487","key":"1_CR2","DOI":"10.1145\/3436487"},{"doi-asserted-by":"publisher","unstructured":"Amarilli, A., Jachiet, L., Mu\u00f1oz, M., Riveros, C.: Efficient enumeration for annotated grammars. In: PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, 12\u201317 June 2022, pp. 291\u2013300 (2022). https:\/\/doi.org\/10.1145\/3517804.3526232","key":"1_CR3","DOI":"10.1145\/3517804.3526232"},{"doi-asserted-by":"publisher","unstructured":"Bourhis, P., Grez, A., Jachiet, L., Riveros, C.: Ranked enumeration of MSO logic on words. In: 24th International Conference on Database Theory, ICDT 2021, 23\u201326 March 2021, Nicosia, Cyprus, pp. 20:1\u201320:19 (2021). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2021.20","key":"1_CR4","DOI":"10.4230\/LIPICS.ICDT.2021.20"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/S00224-020-10013-W","volume":"65","author":"K Casel","year":"2021","unstructured":"Casel, K., Fernau, H., Gaspers, S., Gras, B., Schmid, M.L.: On the complexity of the smallest grammar problem over fixed alphabets. Theory Comput. Syst. 65(2), 344\u2013409 (2021). https:\/\/doi.org\/10.1007\/S00224-020-10013-W","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"publisher","unstructured":"Doleschal, J., Bratman, N., Kimelfeld, B., Martens, W.: The complexity of aggregates over extractions by regular expressions. In: 24th International Conference on Database Theory, ICDT 2021, 23\u201326 March 2021, Nicosia, Cyprus, pp. 10:1\u201310:20 (2021). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2021.10","key":"1_CR6","DOI":"10.4230\/LIPICS.ICDT.2021.10"},{"doi-asserted-by":"publisher","unstructured":"Doleschal, J., Kimelfeld, B., Martens, W., Nahshon, Y., Neven, F.: Split-correctness in information extraction. In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30\u20135 July 2019, pp. 149\u2013163 (2019). https:\/\/doi.org\/10.1145\/3294052.3319684","key":"1_CR7","DOI":"10.1145\/3294052.3319684"},{"doi-asserted-by":"publisher","unstructured":"Doleschal, J., Kimelfeld, B., Martens, W., Peterfreund, L.: Weight annotation in information extraction. In: 23rd International Conference on Database Theory, ICDT 2020, March 30\u20132 April 2020, Copenhagen, Denmark, pp. 8:1\u20138:18 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2020.8","key":"1_CR8","DOI":"10.4230\/LIPIcs.ICDT.2020.8"},{"doi-asserted-by":"crossref","unstructured":"Fagin, R., Kimelfeld, B., Reiss, F., Vansummeren, S.: Document spanners: a formal approach to information extraction. J. ACM 62(2), 12:1\u201312:51 (2015)","key":"1_CR9","DOI":"10.1145\/2699442"},{"doi-asserted-by":"publisher","unstructured":"Florenzano, F., Riveros, C., Ugarte, M., Vansummeren, S., Vrgoc, D.: Efficient enumeration algorithms for regular document spanners. ACM Trans. Database Syst. 45(1), 3:1\u20133:42 (2020). https:\/\/doi.org\/10.1145\/3351451","key":"1_CR10","DOI":"10.1145\/3351451"},{"issue":"7","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1007\/s00224-018-9874-1","volume":"63","author":"D Freydenberger","year":"2019","unstructured":"Freydenberger, D.: A logic for document spanners. Theory Comput. Syst. 63(7), 1679\u20131754 (2019). https:\/\/doi.org\/10.1007\/s00224-018-9874-1","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/s00224-017-9770-0","volume":"62","author":"D Freydenberger","year":"2018","unstructured":"Freydenberger, D., Holldack, M.: Document spanners: from expressive power to decision problems. Theory Comput. Syst. 62(4), 854\u2013898 (2018)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"publisher","unstructured":"Freydenberger, D.D., Kimelfeld, B., Peterfreund, L.: Joining extractions of regular expressions. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, 10\u201315 June 2018, pp. 137\u2013149 (2018). https:\/\/doi.org\/10.1145\/3196959.3196967","key":"1_CR13","DOI":"10.1145\/3196959.3196967"},{"unstructured":"Freydenberger, D.D., Thompson, S.M.: Dynamic complexity of document spanners. In: 23rd International Conference on Database Theory, ICDT 2020, March 30\u20132 April 2020, Copenhagen, Denmark, pp. 11:1\u201311:21 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2020.11","key":"1_CR14"},{"doi-asserted-by":"publisher","unstructured":"Freydenberger, D.D., Thompson, S.M.: Splitting spanner atoms: a tool for acyclic core spanners. In: 25th International Conference on Database Theory, ICDT 2022, March 29 to 1 April 2022, Edinburgh, UK (Virtual Conference), pp. 10:1\u201310:18 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2022.10","key":"1_CR15","DOI":"10.4230\/LIPIcs.ICDT.2022.10"},{"doi-asserted-by":"publisher","unstructured":"Ganardi, M., Gawrychowski, P.: Pattern matching on grammar-compressed strings in linear time. In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference\/Alexandria, VA, USA, 9\u201312 January 2022, pp. 2833\u20132846 (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.110","key":"1_CR16","DOI":"10.1137\/1.9781611977073.110"},{"doi-asserted-by":"publisher","unstructured":"Ganardi, M., Jez, A., Lohrey, M.: Balancing straight-line programs. J. ACM 68(4), 27:1\u201327:40 (2021). https:\/\/doi.org\/10.1145\/3457389","key":"1_CR17","DOI":"10.1145\/3457389"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups Complex. Cryptol. 4(2), 241\u2013299 (2012). https:\/\/doi.org\/10.1515\/gcc-2012-0016","journal-title":"Groups Complex. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Maturana, F., Riveros, C., Vrgoc, D.: Document spanners for extracting incomplete information: expressiveness and complexity. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, 10\u201315 June 2018, pp. 125\u2013136 (2018). https:\/\/doi.org\/10.1145\/3196959.3196968","key":"1_CR19","DOI":"10.1145\/3196959.3196968"},{"doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, M., Riveros, C.: Constant-delay enumeration for SLP-compressed documents. In: 26th International Conference on Database Theory, ICDT 2023, 28\u201331 March 2023, Ioannina, Greece, pp. 7:1\u20137:17 (2023). https:\/\/doi.org\/10.4230\/LIPICS.ICDT.2023.7","key":"1_CR20","DOI":"10.4230\/LIPICS.ICDT.2023.7"},{"unstructured":"Peterfreund, L.: The Complexity of Relational Queries over Extractions from Text. Ph.D. thesis (2019)","key":"1_CR21"},{"doi-asserted-by":"publisher","unstructured":"Peterfreund, L.: Grammars for document spanners. In: 24th International Conference on Database Theory, ICDT 2021, 23\u201326 March 2021, Nicosia, Cyprus, pp. 7:1\u20137:18 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.7","key":"1_CR22","DOI":"10.4230\/LIPIcs.ICDT.2021.7"},{"unstructured":"Peterfreund, L., ten Cate, B., Fagin, R., Kimelfeld, B.: Recursive programs for document spanners. In: 22nd International Conference on Database Theory, ICDT 2019, 26\u201328 March 2019, Lisbon, Portugal, pp. 13:1\u201313:18 (2019)","key":"1_CR23"},{"doi-asserted-by":"crossref","unstructured":"Peterfreund, L., Freydenberger, D.D., Kimelfeld, B., Kr\u00f6ll, M.: Complexity bounds for relational algebra over document spanners. In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30\u20135 July 2019, pp. 320\u2013334 (2019)","key":"1_CR24","DOI":"10.1145\/3294052.3319699"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2016.02.003","volume":"249","author":"ML Schmid","year":"2016","unstructured":"Schmid, M.L.: Characterising REGEX languages by regular languages equipped with factor-referencing. Inf. Comput. (I &C) 249, 1\u201317 (2016)","journal-title":"Inf. Comput. (I &C)"},{"doi-asserted-by":"publisher","unstructured":"Schmid, M.L., Schweikardt, N.: A purely regular approach to non-regular core spanners. In: 24th International Conference on Database Theory, ICDT 2021, 23\u201326 March 2021, Nicosia, Cyprus, pp. 4:1\u20134:19 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.4","key":"1_CR26","DOI":"10.4230\/LIPIcs.ICDT.2021.4"},{"doi-asserted-by":"publisher","unstructured":"Schmid, M.L., Schweikardt, N.: Spanner evaluation over SLP-compressed documents. In: PODS\u201921: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, 20\u201325 June 2021, pp. 153\u2013165 (2021). https:\/\/doi.org\/10.1145\/3452021.3458325","key":"1_CR27","DOI":"10.1145\/3452021.3458325"},{"doi-asserted-by":"publisher","unstructured":"Schmid, M.L., Schweikardt, N.: Document spanners - a brief overview of concepts, results, and recent developments. In: PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, 12\u201317 June 2022, pp. 139\u2013150 (2022). https:\/\/doi.org\/10.1145\/3517804.3526069","key":"1_CR28","DOI":"10.1145\/3517804.3526069"},{"doi-asserted-by":"publisher","unstructured":"Schmid, M.L., Schweikardt, N.: Query evaluation over SLP-represented document databases with complex document editing. In: PODS \u201922: International Conference on Management of Data, Philadelphia, PA, USA, 12\u201317 June 2022, pp. 79\u201389 (2022). https:\/\/doi.org\/10.1145\/3517804.3524158","key":"1_CR29","DOI":"10.1145\/3517804.3524158"},{"doi-asserted-by":"publisher","unstructured":"Schweikardt, N., Segoufin, L., Vigny, A.: Enumeration for FO queries over nowhere dense graphs. J. ACM 69(3), 22:1\u201322:37 (2022). https:\/\/doi.org\/10.1145\/3517035","key":"1_CR30","DOI":"10.1145\/3517035"},{"doi-asserted-by":"publisher","unstructured":"Segoufin, L.: A glimpse on constant delay enumeration (invited talk). In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, 5\u20138 March 2014, Lyon, France, pp. 13\u201327 (2014). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2014.13","key":"1_CR31","DOI":"10.4230\/LIPICS.STACS.2014.13"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2783888.2783894","volume":"44","author":"L Segoufin","year":"2015","unstructured":"Segoufin, L.: Constant delay enumeration for conjunctive queries. SIGMOD Rec. 44(1), 10\u201317 (2015)","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:03:08Z","timestamp":1711569788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}