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

Minimum Redundancy Synonym Generator Data Storage Technique

IP.com Disclosure Number: IPCOM000042336D
Original Publication Date: 1984-May-01
Included in the Prior Art Database: 2005-Feb-03
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Carlgren, RG: AUTHOR [+2]

Abstract

This storage technique makes use of a relational data base to minimize the main and secondary storage requirements to store and access synonym data related to words in a stored dictionary. This is accomplished by representing the synonyms for a given word as a list of pointers into a related word list which is used to provide the actual spelling of the synonyms. Since not all words have synonyms, the synonym pointer lists are separated by a skip count which indicates how many dictionary words are to be skipped before encountering another dictionary word for which synonyms exist. To simplify the access to the synonym generator linguistic aid, the synonym data is stored in an independent segment of the related dictionary data base.

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

Page 1 of 1

Minimum Redundancy Synonym Generator Data Storage Technique

This storage technique makes use of a relational data base to minimize the main and secondary storage requirements to store and access synonym data related to words in a stored dictionary. This is accomplished by representing the synonyms for a given word as a list of pointers into a related word list which is used to provide the actual spelling of the synonyms. Since not all words have synonyms, the synonym pointer lists are separated by a skip count which indicates how many dictionary words are to be skipped before encountering another dictionary word for which synonyms exist. To simplify the access to the synonym generator linguistic aid, the synonym data is stored in an independent segment of the related dictionary data base. On computer systems which are constrained by having a minimum of available main and secondary storage, linguistic services which require a large data base must employ storage and access techniques which minimize both storage requirements. With the present technique, a synonym list pointer can be stored as a single bit string which represents the dictionary word list data block number and offset of the indicated word within the block. If the size of the word list data block is increased, then the number of bits needed to represent an offset within the data block is correspondingly increased. However, the number of bits needed to represent the block number is reduced by an equal a...