Browse Prior Art Database

Spelling Dictionary Incorporating Word Association

IP.com Disclosure Number: IPCOM000045874D
Original Publication Date: 1983-Apr-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Parrott, RD: AUTHOR

Abstract

A spelling dictionary utilized in a word processing device for checking the correct spelling of words within a document is enhanced to include a word association feature, thereby allowing the dictionary to act as a thesaurus identifying synonyms and antonyms for each word of the dictionary.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 52% of the total text.

Page 1 of 1

Spelling Dictionary Incorporating Word Association

A spelling dictionary utilized in a word processing device for checking the correct spelling of words within a document is enhanced to include a word association feature, thereby allowing the dictionary to act as a thesaurus identifying synonyms and antonyms for each word of the dictionary.

Fig. 1 depicts a list of words of a very small spelling dictionary. A more typical spelling dictionary would contain in excess of 20,000 words. The characters in the dictionary serve as word delimiters. The words are sorted alphabetically to speed the search for a particular word. Fig. 2 shows the sample dictionary of Fig. 1 after it has been modified to point to entries within a synonym/antonym table. Each $ symbol has been added to indicate that the following number contains an index into a synonym/antonym table. The index is a count of the number of entries from the beginning of the synonym/antonym table to the referenced entry. Each byte of the number always has its most significant bit on while the combination of the last seven least significant bits of the bytes in the number contain the index value. The significant bit is examined to determine if the remainder of that byte should be interpreted as an index or as a character since the characters are in seven-bit code.

Fig. 3 shows the arrangement of the words of Fig. 1 within the synonym/antonym table. Each numbered (non-null) entry contains a list of synonyms. An adjacent entry contains a list of antonyms for those synonyms. If a word is chosen from an even numbered entry, its...