{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:14Z","timestamp":1725493454307},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_34","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"320-321","source":"Crossref","is-referenced-by-count":1,"title":["A New Method for Compiling Parallel Replacement Rules"],"prefix":"10.1007","author":[{"given":"Anssi","family":"Yli-Jyr\u00e4","sequence":"first","affiliation":[]},{"given":"Kimmo","family":"Koskenniemi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, A., Karttunen, L.: Parallel replacement in finite state calculus. In: 16th COLING 1996, Proc. Conference, Copenhagen, Denmark, vol.\u00a02, pp. 622\u2013627 (1996)","DOI":"10.3115\/993268.993277"},{"key":"34_CR2","first-page":"331","volume":"20","author":"R.M. Kaplan","year":"1994","unstructured":"Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020, 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: 34th ACL 1996, Proc. Conference, Santa Cruz, CA, USA, pp. 231\u2013238 (1996)","DOI":"10.3115\/981863.981894"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: The replace operator. In: 33th ACL 1995, Proceedings of the Conference, Cambridge, MA, USA, pp. 16\u201323 (1995)","DOI":"10.3115\/981658.981661"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Gerdemann, D., van Noord, G.: Transducers from rewrite rules with backreferences. In: 9th EACL 1999, Proceedings of the Conference, pp. 126\u2013133 (1999)","DOI":"10.3115\/977035.977053"},{"key":"34_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11816508_19","volume-title":"Advances in Natural Language Processing","author":"A. Yli-Jyr\u00e4","year":"2006","unstructured":"Yli-Jyr\u00e4, A., Koskenniemi, K.: Compiling generalized two-level rules and grammars. In: Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. (eds.) FinTAL 2006. LNCS (LNAI), vol.\u00a04139, Springer, Heidelberg (2006)"},{"key":"34_CR7","unstructured":"Gerdemann, D., van Noord, G.: Approximation and exactness in Finite-State Optimality Theory. In: Eisner, J., Karttunen, L., Th\u00e9riault, A. (eds.) SIGPHON 2000, Finite State Phonology (2000)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:15Z","timestamp":1619520495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_34","relation":{},"subject":[]}}