{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:08:10Z","timestamp":1725829690378},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319239781"},{"type":"electronic","value":"9783319239804"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23980-4_11","type":"book-chapter","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T10:15:06Z","timestamp":1442312106000},"page":"166-183","source":"Crossref","is-referenced-by-count":0,"title":["Grammar Debugging"],"prefix":"10.1007","author":[{"given":"Michael","family":"Maxwell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"11_CR1","volume-title":"Finite State Morphology","author":"KR Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. University of Chicago Press, Chicago (2003)"},{"key":"11_CR2","volume-title":"Perspectives on Software Requirements","author":"DM Berry","year":"2003","unstructured":"Berry, D.M., Kamsties, E.: Ambiguity in requirements specification. In: do Prado Leite, J.C.S., Doorn, J.H. (eds.) Perspectives on Software Requirements, vol. 753. Springer, US (2003)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bonet, E., Harbour, D.: Contextual allomorphy. In: Trommer, J. (ed.) The Morphology and Phonology of Exponence, Oxford Studies in Theoretical Linguistics, vol. 41. Oxford University Press (2012)","DOI":"10.1093\/acprof:oso\/9780199573721.003.0007"},{"key":"11_CR4","volume-title":"Allomorphy in Inflexion","author":"AD Carstairs","year":"1987","unstructured":"Carstairs, A.D.: Allomorphy in Inflexion. Croom Helm, London (1987)"},{"key":"11_CR5","unstructured":"David, A., Maxwell, M.: Joint grammar development by linguists and computer scientists. In: Third International Joint Conference on Natural Language Processing, IJCNLP 2008, Hyderabad, India, 7\u201312 January, 2008, pp. 27\u201334. The Association for Computer Linguistics (2008). \n                  http:\/\/aclweb.org\/anthology\/I\/I08\/I08-3007.pdf"},{"key":"11_CR6","series-title":"Methodology","volume-title":"Basic Linguistic Theory","author":"RMW Dixon","year":"2009","unstructured":"Dixon, R.M.W.: Basic Linguistic Theory. Methodology, vol. 1. Oxford University Press, Oxford (2009)"},{"key":"11_CR7","series-title":"Grammatical Topics","volume-title":"Basic Linguistic Theory","author":"RMW Dixon","year":"2009","unstructured":"Dixon, R.M.W.: Basic Linguistic Theory. Grammatical Topics, vol. 2. Oxford University Press, Oxford (2009)"},{"key":"11_CR8","unstructured":"Hulden, M.: Foma: a finite-state compiler and library. In: Proceedings of the ACL, pp. 29\u201332. ACL, Athens (2009). \n                  http:\/\/www.aclweb.org\/anthology\/E\/E09\/E09-2008.pdf"},{"key":"11_CR9","unstructured":"Karttunen, L.: The proper treatment of optimality in computational phonology. In: Karttunen, L., Oflazer, K. (eds.) Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pp. 1\u201312. Bilkent University, Ankara (1998). \n                  http:\/\/www.aclweb.org\/anthology\/W\/W98\/W98-1301.pdf"},{"key":"11_CR10","unstructured":"Kiparsky, P.: \u2018elsewhere\u2019 in phonology. In: Anderson, S.R. (ed.) A Festschrift for Morris Halle, Holt, New York, pp. 93\u2013106 (1973)"},{"key":"11_CR11","unstructured":"Kiparsky, P.: Allomorphy or morphophonology? In: Singh, R. (ed.) Trubetzkoy\u2019s Orphan: Proceedings of the Montreal Roundtable \u201cMorphonology: Contemporary Responses\u201d, Montreal, 30 Sept\u20132 Oct, 1994, pp. 13\u201331. Benjamins, Amsterdam (1996)"},{"key":"11_CR12","unstructured":"Koskenniemi, K.: Two-level Morphology: A General Computational Model for Word-Form Recognition and Production. Ph.D. thesis, University of Helsinki (1983). \n                  http:\/\/www.ling.helsinki.fi\/koskenni\/doc\/Two-LevelMorphology.pdf"},{"key":"11_CR13","first-page":"435","volume":"13","author":"A Marantz","year":"1982","unstructured":"Marantz, A.: Re reduplication. Linguist. Inquiry 13, 435\u2013482 (1982)","journal-title":"Linguist. Inquiry"},{"key":"11_CR14","unstructured":"Maxwell, M.: Standardization as a means to sustainability. In: Workshop on Language Resources: From Storyboard to Sustainability and LR Lifecycle Management, LREC 2010, pp. 30\u201333 (2010)"},{"key":"11_CR15","unstructured":"Maxwell, M.: Electronic grammars and reproducible research. In: Nordoff, S., Poggeman, K.L.G. (eds.) Electronic Grammaticography, pp. 207\u2013235. University of Hawaii Press (2012)"},{"key":"11_CR16","unstructured":"Maxwell, M.: Accounting for allomorphy in finite state transducers. In: Finite-State Methods and Natural Language Processing (2015)"},{"key":"11_CR17","unstructured":"Maxwell, M., David, A.: Interoperable grammars. In: Webster, J., Ide, N., Fang, A.C. (eds.) First International Conference on Global Interoperability for Language Resources (ICGL 2008), Hong Kong, pp. 155\u2013162 (2008). \n                  http:\/\/hdl.handle.net\/1903\/11611"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3366\/E1750124509000282","volume":"2","author":"ME Paster","year":"2009","unstructured":"Paster, M.E.: Explaining phonological conditions on affixation: Evidence from suppletive allomorphy and affix ordering 1. Word Structure 2(1), 18\u201337 (2009)","journal-title":"Word Structure"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11780885_38","volume-title":"Finite-State Methods and Natural Language Processing","author":"H Schmid","year":"2006","unstructured":"Schmid, H.: A programming language for finite state transducers. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol. 4002, pp. 308\u2013309. Springer, Heidelberg (2006)"}],"container-title":["Communications in Computer and Information Science","Systems and Frameworks for Computational Morphology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23980-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:39:49Z","timestamp":1559259589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23980-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319239781","9783319239804"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23980-4_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}