{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:55:04Z","timestamp":1752983704294,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030485153"},{"type":"electronic","value":"9783030485160"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48516-0_4","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Shortest String and the Edit-Distance for Parsing Expression Languages"],"prefix":"10.1007","author":[{"given":"Hyunjoon","family":"Cheon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"4_CR1","unstructured":"Rosie Pattern Language. \nhttps:\/\/rosie-lang.org\n\n. Accessed 7 Jan 2020"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(73)90851-6","volume":"23","author":"A Birman","year":"1973","unstructured":"Birman, A., Ullman, J.D.: Parsing algorithms with backtrack. Inf. Control 23(1), 1\u201334 (1973)","journal-title":"Inf. Control"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ford, B.: Packrat parsing: simple, powerful, lazy, linear time, functional pearl. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), pp. 36\u201347 (2002)","DOI":"10.1145\/583852.581483"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 111\u2013122 (2004)","DOI":"10.1145\/982962.964011"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R Hamming","year":"1950","unstructured":"Hamming, R.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29, 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"issue":"07","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1142\/S0129054113400315","volume":"24","author":"YS Han","year":"2013","unstructured":"Han, Y.S., Ko, S.K., Salomaa, K.: The edit-distance between a regular language and a context-free language. Int. J. Found. Comput. Sci. 24(07), 1067\u20131082 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"7","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1142\/S0129054118500296","volume":"29","author":"T Koga","year":"2018","unstructured":"Koga, T.: Context-freeness of parsing expression languages is undecidable. Int. J. Found. Comput. Sci. 29(7), 1203\u20131213 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"9","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.ic.2007.06.001","volume":"205","author":"S Konstantinidis","year":"2007","unstructured":"Konstantinidis, S.: Computing the edit distance of a regular language. Inf. Comput. 205(9), 1307\u20131316 (2007)","journal-title":"Inf. Comput."},{"key":"4_CR9","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys. Dokl. 10, 707\u2013710 (1966)","journal-title":"Soviet Phys. Dokl."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-98654-8_40","volume-title":"Developments in Language Theory","author":"B Loff","year":"2018","unstructured":"Loff, B., Moreira, N., Reis, R.: The computational power of parsing expression grammars. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 491\u2013502. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98654-8_40\n\n. Extended version is available on arXiv: \nhttps:\/\/arxiv.org\/abs\/1902.08272"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2012.11.006","volume":"93","author":"S Medeiros","year":"2014","unstructured":"Medeiros, S., Mascarenhas, F., Ierusalimschy, R.: From regexes to parsing expression grammars. Sci. Comput. Program. 93, 3\u201318 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"06","key":"4_CR12","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata: general definitions and algorithms. Int. J. Found. Comput. Sci. 14(06), 957\u2013982 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"02","key":"4_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1142\/S0129054118400099","volume":"29","author":"T Ng","year":"2018","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of neighbourhoods and approximate pattern matching. Int. J. Found. Comput. Sci. 29(02), 315\u2013329 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"4_CR14","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Comb. 6(4), 519\u2013535 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"9\u201310","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1016\/j.ic.2008.03.023","volume":"206","author":"A Okhotin","year":"2008","unstructured":"Okhotin, A.: Unambiguous Boolean grammars. Inf. Comput. 206(9\u201310), 1234\u20131247 (2008)","journal-title":"Inf. Comput."},{"key":"4_CR16","unstructured":"Povarov, G.: Descriptive complexity of the hamming neighborhood of a regular language. In: Proceedings of the 1st International Conference on Language and Automata Theory and Applications, pp. 509\u2013520 (2007)"},{"key":"4_CR17","volume-title":"Introduction to the Theory of Computataion","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computataion, 3rd edn. Cengage Learning, Boston (2013)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:02:44Z","timestamp":1590451364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","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":"38","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":"24","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":"63% - 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.7","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":"1.48","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)"}},{"value":"Conference cancelled due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}