Browse Prior Art Database

Unfold Skipping for Spelling Correction Function

IP.com Disclosure Number: IPCOM000042097D
Original Publication Date: 1984-Mar-01
Included in the Prior Art Database: 2005-Feb-03
Document File: 2 page(s) / 51K

Publishing Venue

IBM

Related People

Garrison, DA: AUTHOR [+3]

Abstract

This article describes a method for increasing the efficiency of a spelling correction function by using a filter to eliminate the need to "unfold" sections of logical records. The variable field dictionary structure requires unfolding of each nibble (byte) of a logic record during processing. This constitutes a major part of the time spent. This method eliminates 50% to 60% of the unfold time depending on the number of words in the dictionary. During the dictionary build process "skip counts" are computed. These counts delineate regions of each record that have "identical" first three-character content. Identical is qualified since the dictionary structure stores root words in a sort order with certain character features suppressed.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 70% of the total text.

Page 1 of 2

Unfold Skipping for Spelling Correction Function

This article describes a method for increasing the efficiency of a spelling correction function by using a filter to eliminate the need to "unfold" sections of logical records. The variable field dictionary structure requires unfolding of each nibble (byte) of a logic record during processing. This constitutes a major part of the time spent. This method eliminates 50% to 60% of the unfold time depending on the number of words in the dictionary. During the dictionary build process "skip counts" are computed. These counts delineate regions of each record that have "identical" first three-character content. Identical is qualified since the dictionary structure stores root words in a sort order with certain character features suppressed. Namely, words with upper-case characters are sorted as if all the characters were lower case, and words with accented characters are sorted as if all the characters were unaccented. For example, A==> a and a- grave ==> a for sort sequence purposes. Each count points to the starting nibble of the first word of a group of words all having the "same" first three characters. These counts are stored in reverse order at the end of the record. The decode process will now be described with reference to the figure. The variable "chknib" is initialized at the start of a record. Whenever the actual nibble count (nibcnt) equals chknib, the "skip" variable is set. After unfolding a word, if the ski...