{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:14:13Z","timestamp":1778300053400,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1981,1]]},"DOI":"10.1016\/0020-0255(81)90052-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"123-142","source":"Crossref","is-referenced-by-count":37,"title":["An effective algorithm for string correction using generalized edit distances\u2014I. Description of the algorithm and its optimality"],"prefix":"10.1016","volume":"23","author":[{"given":"R.L.","family":"Kashyap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.J.","family":"Oommen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0255(81)90052-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the longest common sub-sequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(81)90052-9_BIB2","series-title":"The Theory of Parsing, Translation and Compiling","author":"Aho","year":"1972"},{"issue":"6","key":"10.1016\/0020-0255(81)90052-9_BIB3","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/T-C.1975.224278","article-title":"Stochastic syntactic decoding for pattern classification","volume":"C-24","author":"Fung","year":"1975","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"10.1016\/0020-0255(81)90052-9_BIB4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TPAMI.1979.4766901","article-title":"Syntactic decision rules for recognition of spoken words and phrases using a stochastic automaton","volume":"PAMI-1","author":"Kashyap","year":"1979","journal-title":"IEEE Trans. Pat. Anal. and Mach. Intel."},{"key":"10.1016\/0020-0255(81)90052-9_BIB5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0255(81)90052-9_BIB6","first-page":"473","volume":"Vol. 1","author":"Knuth","year":"1973"},{"issue":"8","key":"10.1016\/0020-0255(81)90052-9_BIB7","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Physics Dokl."},{"issue":"1","key":"10.1016\/0020-0255(81)90052-9_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/359970.359991","article-title":"A study of errors, error proneness and error diagnosis in cobol","author":"Litecky","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(81)90052-9_BIB9","series-title":"Proceedings of the IEEE Computer Society, 1st International Computer Software and Applications Conference","first-page":"492","article-title":"A sentence-to-sentence clustering procedure for pattern analysis","author":"Lu","year":"1977"},{"key":"10.1016\/0020-0255(81)90052-9_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","article-title":"An ext\u0301ension of the string to string correction problem","volume":"22","author":"Lawrence","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/0020-0255(81)90052-9_BIB11","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/362007.362033","article-title":"Spelling corrections in systems programs","volume":"13","author":"Morgan","year":"1970","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0255(81)90052-9_BIB12","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TIT.1975.1055355","article-title":"The Viterbi algorithm as an aid in text recognition","volume":"IT-21","author":"Neuhoff","year":"1975","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0020-0255(81)90052-9_BIB13","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TC.1976.5009232","article-title":"A method of correction of garbled words based on the Levenshtein metric","volume":"C-25","author":"Okuda","year":"1976","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0020-0255(81)90052-9_BIB14","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/T-C.1974.223971","article-title":"A contextual post processing system for error correction using binary n-grams","volume":"C-23","author":"Reisman","year":"1974","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0020-0255(81)90052-9_BIB15","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1002\/spe.4380070413","article-title":"On detecting misspelt identifiers in fortran","volume":"7","author":"Scowen","year":"1977","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1016\/0020-0255(81)90052-9_BIB16","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/T-C.1974.224000","article-title":"Errors in regular languages","volume":"23","author":"Thomason","year":"1974","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0020-0255(81)90052-9_BIB17","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TIT.1975.1055419","article-title":"Decoding for channels with insertions, deletions, and substitutions with application to speech recognitions","volume":"IT-21","author":"Bahl","year":"1975","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0020-0255(81)90052-9_BIB18","doi-asserted-by":"crossref","unstructured":"R. L. Kashyap and B. J. Oommen, An effective algorithm for string correction using generalized edit distances\u2014II. Computational complexity of the algorithm and some applications Information Sci., to appear.","DOI":"10.1016\/0020-0255(81)90056-6"},{"key":"10.1016\/0020-0255(81)90052-9_BIB19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/comjnl\/20.2.141","article-title":"A binary N-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words","volume":"20","author":"Ullman","year":"1977","journal-title":"Comput. J."},{"key":"10.1016\/0020-0255(81)90052-9_BIB20","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/360980.360995","article-title":"Order-n correction for regular languages","volume":"17","author":"Wagner","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(81)90052-9_BIB21","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":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(81)90052-9_BIB22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds for the String Editing Problem","volume":"23","author":"Wong","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(81)90052-9_BIB23","series-title":"Relative Frequency of English Speech Sounds","author":"Dewey","year":"1923"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025581900529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025581900529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:52:10Z","timestamp":1552913530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025581900529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0020025581900529"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(81)90052-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}