{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:33:39Z","timestamp":1699835619624},"reference-count":13,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":8884,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1982,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>When a document is prepared using a computer system, it can be checked for spelling errors automatically and efficiently. This paper reviews and compares several methods for searching an English spelling dictionary. It also presents a new technique, <jats:italic>hash<\/jats:italic>\u2010<jats:italic>bucket<\/jats:italic> search, for searching a static table in general, and a dictionary in particular. Analysis shows that with only a small amount of space beyond that required to store the keys, the hash\u2010bucket search method has many advantages over existing methods. Experimental results with a sample dictionary using double hashing and the hash\u2010bucket techniques are presented.<\/jats:p>","DOI":"10.1002\/spe.4380120708","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T07:00:59Z","timestamp":1163833259000},"page":"669-682","source":"Crossref","is-referenced-by-count":3,"title":["Hash\u2010bucket search: A fast technique for searching an english spelling dictionary"],"prefix":"10.1002","volume":"12","author":[{"given":"Douglas","family":"Comer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent Y.","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPC.1975.6593963"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1978.tb02146.x"},{"key":"e_1_2_1_4_2","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth D.","year":"1973"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1978.tb02145.x"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359653"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359887"},{"key":"e_1_2_1_8_2","first-page":"209","article-title":"English dictionary searching with little extra space","volume":"79","author":"Comer D.","year":"1979","journal-title":"Proc. NCC"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"A.YaoandF.Yao \u2018The complexity of searching an ordered random table\u2019 Proc. 17th IEEE Symp. on FOCS 173\u2013177(1976).","DOI":"10.1109\/SFCS.1976.32"},{"key":"e_1_2_1_10_2","unstructured":"G.Balbine \u2018Computational analysis of the random component induced by a binary equivalence relation\u2019 Ph.D. Thesis Calif. Inst of Technology 1968 pp.149\u2013150."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322065"},{"key":"e_1_2_1_12_2","unstructured":"G.Gonnet\u2018Expected length of the longest probe sequence in hash code searching\u2019 TR CS\u2010RR\u201078\u201046 Computer Science Department Univ. of Waterloo Waterloo Canada 1978."},{"key":"e_1_2_1_13_2","volume-title":"Computer Algorithms: Introduction to Design and Analysis","author":"Baase S.","year":"1978"},{"key":"e_1_2_1_14_2","volume-title":"Computational Analysis of Present Day American English","author":"Kucera H.","year":"1967"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380120708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380120708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:42:32Z","timestamp":1699800152000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380120708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["10.1002\/spe.4380120708"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380120708","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}