{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:43Z","timestamp":1742914063305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406073"},{"type":"electronic","value":"9783030406080"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40608-0_26","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"369-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Input Strictly Local Tree Transducers"],"prefix":"10.1007","author":[{"given":"Jing","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"key":"26_CR1","volume-title":"Finite State Morphology","author":"K Beesley","year":"2003","unstructured":"Beesley, K., Kartunnen, L.: Finite State Morphology. CSLI Publications, Stanford (2003)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/tacl_a_00198","volume":"2","author":"J Chandlee","year":"2014","unstructured":"Chandlee, J., Eyraud, R., Heinz, J.: Learning strictly local subsequential functions. Trans. Assoc. Comput. Linguist. 2, 491\u2013503 (2014)","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Chandlee, J., Eyraud, R., Heinz, J.: Output strictly local functions. In: Kuhlmann, M., Kanazawa, M., Kobele, G.M. (eds.) Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015), Chicago, USA, pp. 112\u2013125, July 2015","DOI":"10.3115\/v1\/W15-2310"},{"key":"26_CR4","volume-title":"The Minimalist Program","author":"N Chomsky","year":"1995","unstructured":"Chomsky, N.: The Minimalist Program. The MIT Press, Cambridge (1995)"},{"key":"26_CR5","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007). http:\/\/tata.gforge.inria.fr\/. Release 12 Oct 2007"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-14455-4_18","volume-title":"Developments in Language Theory","author":"S Friese","year":"2010","unstructured":"Friese, S., Seidl, H., Maneth, S.: Minimization of deterministic bottom-up tree transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 185\u2013196. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14455-4_18"},{"key":"26_CR7","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (2015). http:\/\/arxiv.org\/abs\/1509.06233. Originally published in 1984"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-22221-4_7","volume-title":"Logical Aspects of Computational Linguistics","author":"T Graf","year":"2011","unstructured":"Graf, T.: Closure properties of minimalist derivation tree languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 96\u2013111. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22221-4_7"},{"key":"26_CR9","unstructured":"Graf, T.: Curbing feature coding: strictly local feature assignment. In: Proceedings of the Society for Computation in Linguistics (SCiL) 2020 (2020, to appear)"},{"key":"26_CR10","unstructured":"Graf, T., Shafiei, N.: C-command dependencies as TSL string constraints. In: Jarosz, G., Nelson, M., O\u2019Connor, B., Pater, J. (eds.) Proceedings of SCiL 2019, pp. 205\u2013215 (2019)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Heinz, J.: The computational nature of phonological generalizations. In: Hyman, L., Plank, F. (eds.) Phonological Typology, Chap. 5, pp. 126\u2013195. Phonetics and Phonology, De Gruyter Mouton (2018)","DOI":"10.1515\/9783110451931-005"},{"key":"26_CR12","volume-title":"Grammatical Inference for Computational Linguistics","author":"J Heinz","year":"2015","unstructured":"Heinz, J., de la Higuera, C., van Zaanen, M.: Grammatical Inference for Computational Linguistics. Synthesis Lectures on Human Language Technologies, Morgan and Claypool (2015)"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Knight, K., May, J.: Applications of weighted automata in natural language processing. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, Chap. 14. EATCS, pp. 571\u2013596. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_14","DOI":"10.1007\/978-3-642-01492-5_14"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-22221-4_9","volume-title":"Logical Aspects of Computational Linguistics","author":"GM Kobele","year":"2011","unstructured":"Kobele, G.M.: Minimalist tree languages are closed under intersection with recognizable tree languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 129\u2013144. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22221-4_9"},{"key":"26_CR15","unstructured":"Maletti, A.: Survey: tree transducers in machine translation. In: Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M., Otto, F. (eds.) Proceedings of the 2nd International Workshop on Non-Classical Models of Automata and Applications. books@ocg.at, vol. 263, pp. 11\u201332. \u00d6sterreichische Computer Gesellschaft (2010)"},{"key":"26_CR16","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"26_CR17","volume-title":"Computational Approaches to Morphology and Syntax","author":"B Roark","year":"2007","unstructured":"Roark, B., Sproat, R.: Computational Approaches to Morphology and Syntax. Oxford University Press, Oxford (2007)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0052167","volume-title":"Logical Aspects of Computational Linguistics","author":"J Rogers","year":"1997","unstructured":"Rogers, J.: Strict LT$$_2$$: regular $${:}{:}$$ local : recognizable. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS, vol. 1328, pp. 366\u2013385. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052167"},{"key":"26_CR19","volume-title":"A Descriptive Approach to Language-Theoretic Complexity","author":"J Rogers","year":"1998","unstructured":"Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI Publications, Stanford (1998)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10849-011-9140-2","volume":"20","author":"J Rogers","year":"2011","unstructured":"Rogers, J., Pullum, G.: Aural pattern recognition experiments and the subregular hierarchy. J. Log. Lang. Inf. 20, 329\u2013342 (2011)","journal-title":"J. Log. Lang. Inf."},{"key":"26_CR21","volume-title":"An Introduction to Syntactic Analysis and Theory","author":"D Sportiche","year":"2013","unstructured":"Sportiche, D., Koopman, H., Stabler, E.: An Introduction to Syntactic Analysis and Theory. Wiley, Hoboken (2013)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40608-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:37Z","timestamp":1741466557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_26","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":"25 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lata2020.irdta.eu\/","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":"59","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":"26","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":"44% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there are 6 invited papers. Due to the coronavirus pandemic the actual conference was postponed to be held together with LATA 2021.","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"}]}}