{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:09Z","timestamp":1725549189746},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_25","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"269-280","source":"Crossref","is-referenced-by-count":5,"title":["Regional Finite-State Error Repair"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Vilares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Otero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Gra\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"58","volume-title":"ACL SIGDAT Workshop on From Texts to Tags: Issues in Multilingual Language Analysis","author":"J.P. Chanod","year":"1995","unstructured":"Chanod, J.P., Tapanainen, P.: Creating a tagset, lexicon and guesser for a French tagger. In: ACL SIGDAT Workshop on From Texts to Tags: Issues in Multilingual Language Analysis, pp. 58\u201364. University College, Dublin (1995)"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics\u00a026(1), 3\u201316 (2000)","journal-title":"Computational Linguistics"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-36390-4_12","volume-title":"Implementation and Application of Automata","author":"J. Gra\u00f1a","year":"2003","unstructured":"Gra\u00f1a, J., Barcala, F.M., Alonso, M.A.: Compilation methods of minimal acyclic automata for large dictionaries. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 135\u2013148. Springer, Heidelberg (2003)"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/146370.146380","volume":"24","author":"K. Kukich","year":"1988","unstructured":"Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys\u00a024(4), 377\u2013439 (1988)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"25_CR5","first-page":"845","volume":"163","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1002\/spe.4380230103","volume":"23","author":"C.L. Lucchesi","year":"1993","unstructured":"Lucchesi, C.L., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Software-Practice and Experience\u00a023(1), 15\u201330 (1993)","journal-title":"Software-Practice and Experience"},{"issue":"1","key":"25_CR7","first-page":"73","volume":"22","author":"K. Oflazer","year":"1996","unstructured":"Oflazer, K.: Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics\u00a022(1), 73\u201389 (1996)","journal-title":"Computational Linguistics"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-36390-4_21","volume-title":"Implementation and Application of Automata","author":"A. Savary","year":"2003","unstructured":"Savary, A.: Typographical nearest-neighbor search in a finite-state lexicon and its application to spelling correction. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol.\u00a02494, pp. 251\u2013260. Springer, Heidelberg (2003)"},{"key":"25_CR9","unstructured":"Sikkel, K.: Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands (1993)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Solak, A., Oflazer, K.: Design and implementation of a spelling checker for Turkish. Literary and Linguistic Computing\u00a08(3) (1993)","DOI":"10.1093\/llc\/8.3.113"},{"key":"25_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4775.001.0001","volume-title":"Morphology and Computation","author":"R. Sproat","year":"1992","unstructured":"Sproat, R.: Morphology and Computation. The MIT Press, Cambridge (1992)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:13Z","timestamp":1605761833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}