Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Spelling Correction Function Enhancement

IP.com Disclosure Number: IPCOM000041667D
Original Publication Date: 1984-Feb-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
Garrison, DA Urquhart, RJ [+details]

Abstract

Described is a method for enhancing the operation of a spelling correction function by arranging and searching the dictionary based on grouping root words having the same set of leading characters into records. At dictionary build time the second and third letter content of each record is determined. This information is stored in a bit mask where the i-th position corresponds to the i-th letter of the alphabet. Specifically, the i-th mask bit is a 0 if and only if there are no roots on the given record that have the i-th letter in the second or third position. Therefore, there is one bit mask for each data record in the dictionary. Normally, during the spelling correction function all the records of one letter group are read in and unfolded looking for close matches with the input word.