{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:00Z","timestamp":1759638240809,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_7","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Tree Automata and\u00a0the\u00a0Yield Theorem for\u00a0Constituent Tree Automata"],"prefix":"10.1007","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"M\u00f6rbitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"WS Brainerd","year":"1969","unstructured":"Brainerd, W.S.: Tree generating regular systems. Inform. Control 14, 217\u2013231 (1969)","journal-title":"Inform. Control"},{"key":"7_CR2","unstructured":"Chomsky, N.: Context-free grammars and pushdown storage. Technical report, MIT Research Lab. in Electronics, Cambridge, MA (1962)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406\u2013451 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR4","unstructured":"Engelfriet, J.: Tree automata and tree grammars. Technical report, DAIMI FN-10, Institute of Mathematics, University of Aarhus, Department of Computer Science, Denmark (1975). arXiv:1510.02036v1 [cs.FL], 7 October 2015"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1162\/COLI_a_00291","volume":"43","author":"K Gebhardt","year":"2017","unstructured":"Gebhardt, K., Nederhof, M.J., Vogler, H.: Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures. Comput. Linguist. 43(3), 465\u2013520 (2017)","journal-title":"Comput. Linguist."},{"key":"7_CR6","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984). arXiv:1509.06233v1 [cs.FL], 21 September 2015"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14846-0","DOI":"10.1007\/978-3-642-14846-0"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Kracht, M.: The Mathematics of Language, vol. 63. Walter de Gruyter (2003)","DOI":"10.1515\/9783110895667"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"K\u00fcbler, S., McDonald, R., Nivre, J.: Dependency Parsing, Synthesis Lectures on Human Language Technologies, vol. 2(1). Morgan & Claypool Publishers LLC (2009)","DOI":"10.2200\/S00169ED1V01Y200901HLT002"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1162\/COLI_a_00125","volume":"39","author":"M Kuhlmann","year":"2013","unstructured":"Kuhlmann, M.: Mildly non-projective dependency grammar. Comput. Linguist. 39(2), 355\u2013387 (2013)","journal-title":"Comput. Linguist."},{"issue":"1","key":"7_CR11","first-page":"91","volume":"13","author":"J McCawley","year":"1982","unstructured":"McCawley, J.: Parentheticals and discontinuous constituent structure. Linguist. Inq. 13(1), 91\u2013106 (1982)","journal-title":"Linguist. Inq."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoret. Comput. Sci. 88(2), 191\u2013229 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D., Joshi, A.: Charaterizing structural descriptions produced by various grammatical formalisms. In: Proceedings 25th Annual Meeting of the ACL, pp. 104\u2013111. Association for Computational Linguistics (1987)","DOI":"10.3115\/981175.981190"},{"key":"7_CR14","unstructured":"Weir, D.: Characterizing mildly context-sensitive grammar formalisms. Ph.D. thesis, University of Pennsylvania (1988)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07469-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:05:58Z","timestamp":1655766358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","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":"26","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":"16","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":"3","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":"62% - 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","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":"2.8","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)"}}]}}