{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:57:26Z","timestamp":1753275446677},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662596470"},{"type":"electronic","value":"9783662596487"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-662-59648-7_3","type":"book-chapter","created":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T20:04:09Z","timestamp":1564603449000},"page":"35-50","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Structure Sensitive Tier Projection: Applications and Formal Properties"],"prefix":"10.1007","author":[{"given":"Aniello","family":"De Santo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Graf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,5]]},"reference":[{"issue":"18","key":"3_CR1","first-page":"64","volume":"20","author":"A Aksenova","year":"2018","unstructured":"Aksenova, A., Deshmukh, S.: Formal restrictions on multiple tiers. Proc. Soc. Comput. Linguist. (SCiL) 20(18), 64\u201373 (2018)","journal-title":"Proc. Soc. Comput. Linguist. (SCiL)"},{"key":"3_CR2","unstructured":"Applegate, R.: Ineseno chumash grammar. Ph.D. thesis, UC Berkeley (1972)"},{"key":"3_CR3","unstructured":"Baek, H.: Computational representation of unbounded stress patterns: tiers with structural features. In: Proceedings of the 53rd Meeting of the Chicago Linguistic Society (CLS53) (2017)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"JA Brzozowski","year":"1978","unstructured":"Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16(1), 37\u201355 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chandlee, J.: Strictly local phonological processes. Ph.D. thesis, University of Delaware (2014)","DOI":"10.3765\/exabs.v0i0.2406"},{"key":"3_CR6","first-page":"491","volume":"2","author":"J Chandlee","year":"2014","unstructured":"Chandlee, J., Eyraud, R., Heinz, J.: Learning strictly local subsequential functions. Trans. ACL 2, 491\u2013503 (2014)","journal-title":"Trans. ACL"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1162\/LING_a_00265","volume":"49","author":"J Chandlee","year":"2018","unstructured":"Chandlee, J., Heinz, J.: Strict locality and phonological maps. Linguist. Inq. 49, 23\u201360 (2018)","journal-title":"Linguist. Inq."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"276","DOI":"10.3389\/fpsyg.2018.00276","volume":"9","author":"A Santo De","year":"2018","unstructured":"De Santo, A.: Commentary: developmental constraints on learning artificial grammars with fixed, flexible, and free word order. Front. Psychol. 9, 276 (2018)","journal-title":"Front. Psychol."},{"key":"3_CR9","volume-title":"Automata, Languages, and Machines.","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc., Cambridge (1974)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-20877-5_26","volume-title":"Theory and Applications of Models of Computation","author":"J Fu","year":"2011","unstructured":"Fu, J., Heinz, J., Tanner, H.G.: An algebraic characterization of strictly piecewise languages. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 252\u2013263. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_26"},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"3_CR12","unstructured":"Goldsmith, J.: Autosegmental phonology. Ph.D. thesis, MIT, Cambridge (1976)"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1017\/S0952675717000197","volume":"34","author":"Thomas Graf","year":"2017","unstructured":"Graf, T.: The power of locality domains in phonology. Phonology 34(2), pp. 385\u2013405 (2017). https:\/\/doi.org\/10.1017\/S0952675717000197","journal-title":"Phonology"},{"key":"3_CR14","unstructured":"Graf, T.: Locality domains and phonological c-command over strings. In: 2017 Proceedings of NELS (2018). http:\/\/ling.auf.net\/lingbuzz\/004080"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Graf, T., Mayer, C.: Sanskrit n-retroflexion is input-output tier-based strictly local. In: 2018 Proceedings of SIGMORPHON (2018)","DOI":"10.18653\/v1\/W18-5817"},{"key":"3_CR16","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, Mouton De Gruyter (2018)","DOI":"10.1515\/9783110451931-005"},{"key":"3_CR17","unstructured":"Heinz, J., Rawal, C., Tanner, H.: Tier-based strictly local constraints for phonology. In: Proceedings of the ACL 49th: Human Language Technologies: Short Papers - vol. 2, pp. 58\u201364 (2011). http:\/\/dl.acm.org\/citation.cfm?id=2002736.2002750"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Heinz, J., Riggle, J.: Learnability. In: van Oostendorp, M., Ewen, C., Hume, B., Rice, K. (eds.) Blackwell Companion to Phonology. Wiley-Blackwell, Hoboken (2011)","DOI":"10.1002\/9781444335262.wbctp0003"},{"issue":"1598","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1098\/rstb.2012.0077","volume":"367","author":"G J\u00e4ger","year":"2012","unstructured":"J\u00e4ger, G., Rogers, J.: Formal language theory: refining the chomsky hierarchy. Philos. Trans. R. Soc. B: Biol. Sci. 367(1598), 1956\u20131970 (2012)","journal-title":"Philos. Trans. R. Soc. B: Biol. Sci."},{"key":"3_CR20","unstructured":"Jardine, A.: Computationally, tone is different. Phonology (2016). http:\/\/udel.edu\/~ajardine\/files\/jardinemscomputationallytoneisdifferent.pdf"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1162\/tacl_a_00085","volume":"4","author":"Adam Jardine","year":"2016","unstructured":"Jardine, A., Heinz, J.: Learning tier-based strictly 2-local languages. Trans. ACL 4, 87\u201398 (2016). https:\/\/aclweb.org\/anthology\/Q\/Q16\/Q16-1007.pdf","journal-title":"Transactions of the Association for Computational Linguistics"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-53733-7_4","volume-title":"Language and Automata Theory and Applications","author":"A Jardine","year":"2017","unstructured":"Jardine, A., McMullin, K.: Efficient learning of tier-based strictly k-local languages. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 64\u201376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_4"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-57784-4_4","volume-title":"Formal Grammar 2018","author":"C Mayer","year":"2018","unstructured":"Mayer, C., Major, T.: A challenge for tier-based strict locality from Uyghur backness harmony. In: Foret, A., Kobele, G., Pogodalla, S. (eds.) FG 2018. LNCS, vol. 10950, pp. 62\u201383. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57784-4_4"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"McMullin, K.: Tier-based locality in long-distance phonotactics?: learnability and typology. Ph.D. thesis, University of British Columbia, February (2016). https:\/\/doi.org\/10.14288\/1.0228114","DOI":"10.14288\/1.0228114"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"McMullin, K., Aks\u00ebnova, A., De Santo, A. (2019): Learning phonotactic restrictions on multiple tiers. Proc. SCiL 2(1), pp. 377\u2013378 (2019). https:\/\/doi.org\/10.7275\/s8ym-bx57","DOI":"10.7275\/s8ym-bx57"},{"key":"3_CR26","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"3_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"JE Pin","year":"1986","unstructured":"Pin, J.E.: Varieties of Formal Languages. Plenum Publishing Co., New York (1986)"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14322-9_19","volume-title":"The Mathematics of Language","author":"J Rogers","year":"2010","unstructured":"Rogers, J., et al.: On languages piecewise testable in the strict sense. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 2007\/2009. LNCS (LNAI), vol. 6149, pp. 255\u2013265. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14322-9_19"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-39998-5_6","volume-title":"Formal Grammar","author":"J Rogers","year":"2013","unstructured":"Rogers, J., Heinz, J., Fero, M., Hurst, J., Lambert, D., Wibel, S.: Cognitive and sub-regular complexity. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012-2013. LNCS, vol. 8036, pp. 90\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39998-5_6"},{"issue":"3","key":"3_CR30","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.K.: Aural pattern recognition experiments and the subregular hierarchy. J. Logic Lang. Inf. 20(3), 329\u2013342 (2011)","journal-title":"J. Logic Lang. Inf."},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"321","DOI":"10.3765\/bls.v26i1.1164","volume":"26","author":"R Walker","year":"2000","unstructured":"Walker, R.: Yaka nasal harmony: spreading or segmental correspondence? Annu. Meet. Berkeley Linguist. Soc. 26(1), 321\u2013332 (2000). https:\/\/doi.org\/10.3765\/bls.v26i1.1164","journal-title":"Annu. Meet. Berkeley Linguist. Soc."},{"key":"3_CR34","unstructured":"Yli-Jyr\u00e4, A.: Contributions to the theory of finite-state based linguistic grammars. Ph.D. thesis, University of Helsinki (2005). http:\/\/www.ling.helsinki.fi\/~aylijyra\/dissertation\/contribu.pdf"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59648-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T19:56:53Z","timestamp":1664049413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59648-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662596470","9783662596487"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59648-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Grammar","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","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":"fg2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fg.phil.hhu.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"11","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":"7","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":"64% - 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","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)"}}]}}