{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T19:48:44Z","timestamp":1673725724663},"reference-count":20,"publisher":"Elsevier BV","issue":"22","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T00:00:00Z","timestamp":1456358400000},"content-version":"vor","delay-in-days":1761,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1016\/j.tcs.2011.01.013","type":"journal-article","created":{"date-parts":[[2011,1,22]],"date-time":"2011-01-22T09:35:15Z","timestamp":1295688915000},"page":"2340-2355","source":"Crossref","is-referenced-by-count":4,"title":["Deciding word neighborhood with universal neighborhood automata"],"prefix":"10.1016","volume":"412","author":[{"given":"Petar","family":"Mitankin","sequence":"first","affiliation":[]},{"given":"Stoyan","family":"Mihov","sequence":"additional","affiliation":[]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.01.013_br000005","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/146370.146380","article-title":"Techniques for automatically correcting words in texts","author":"Kukich","year":"1992","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"10.1016\/j.tcs.2011.01.013_br000010","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1162\/0891201042544938","article-title":"Fast approximate search in large dictionaries","volume":"30","author":"Mihov","year":"2004","journal-title":"Computational Linguistics"},{"key":"10.1016\/j.tcs.2011.01.013_br000015","unstructured":"S. Cucerzan, E. Brill, Spelling correction as an iterative process that exploits the collective knowledge of web users, in: Proceedings of the Conference on Empirical Methods in Natural Language Processing, 2004, pp. 293\u2013300."},{"key":"10.1016\/j.tcs.2011.01.013_br000020","series-title":"Handbook of Character Recognition and Document Image Analysis","first-page":"227","article-title":"Techniques for improving OCR results","author":"Dengel","year":"1997"},{"key":"10.1016\/j.tcs.2011.01.013_br000025","series-title":"Information Retrieval: Data Structures and Algorithms","year":"1992"},{"key":"10.1016\/j.tcs.2011.01.013_br000030","series-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.013_br000035","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/csla.2001.0184","article-title":"Weighted finite-state transducers in speech recognition","volume":"16","author":"Mohri","year":"2002","journal-title":"Computer Speech & Language"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.013_br000040","first-page":"73","article-title":"Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction","volume":"22","author":"Oflazer","year":"1996","journal-title":"Computational Linguistics"},{"key":"10.1016\/j.tcs.2011.01.013_br000045","series-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"Durbin","year":"1999"},{"issue":"6","key":"10.1016\/j.tcs.2011.01.013_br000050","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1142\/S0129054103002114","article-title":"Edit-distance of weighted automata: general definitions and algorithms","volume":"14","author":"Mohri","year":"2003","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10.1016\/j.tcs.2011.01.013_br000055","doi-asserted-by":"crossref","unstructured":"K. Schulz, S. Mihov, P. Mitankin, Fast selection of small and precise candidate sets from dictionaries for text correction tasks, in: Proceedings of the Ninth International Conference on Document Analysis and Recognition, 2007 pp. 471\u2013475.","DOI":"10.1109\/ICDAR.2007.4378754"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.013_br000060","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2011.01.013_br000065","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Information and Control"},{"key":"10.1016\/j.tcs.2011.01.013_br000070","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/j.tcs.2011.01.013_br000075","first-page":"227","article-title":"Deterministic part-of-speech tagging with finite-state transducers","volume":"21","author":"Roche","year":"1995","journal-title":"Computational Linguistics"},{"key":"10.1016\/j.tcs.2011.01.013_br000080","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","author":"Levenshtein","year":"1966","journal-title":"Soviet Physics \u2014 Doklady"},{"key":"10.1016\/j.tcs.2011.01.013_br000085","series-title":"Automata, Languages and Machines, vol. A","author":"Eilenberg","year":"1974"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.013_br000090","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","article-title":"Synchronized rational relations of finite and infinite words","volume":"108","author":"Frougny","year":"1993","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/j.tcs.2011.01.013_br000095","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1051\/ita:2000111","article-title":"Asynchronous sliding block maps","volume":"34","author":"B\u00e9al","year":"2000","journal-title":"Informatique Th\u00e9orique et Applications"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2011.01.013_br000100","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2007.01.012","article-title":"The growth ratio of synchronous rational relations is unique","volume":"376","author":"Carton","year":"2007","journal-title":"Theoretical Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511000399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511000399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T10:50:11Z","timestamp":1544007011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511000399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":20,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["S0304397511000399"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.01.013","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}