Browse Prior Art Database

Minimum Redundancy Hyphenation Data Storage Technique

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

Publishing Venue

IBM

Related People

Carlgren, RG: AUTHOR [+2]

Abstract

A relational data base is used to represent the hyphen data associated with the words in a stored dictionary to minimize the secondary storage required to represent that data. The hyphen points for a given word are represented as a variation on the hyphen points for the previous word represented in the data base. In this manner, it is only necessary to determine the relative position within the main dictionary of the word whose hyphen points are required and then to locate the corresponding position within the relational data base. On computer systems which have a minimum of available main storage, it is necessary to store dictionaries used for automatic hyphenation support on secondary storage devices.

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

Page 1 of 2

Minimum Redundancy Hyphenation Data Storage Technique

A relational data base is used to represent the hyphen data associated with the words in a stored dictionary to minimize the secondary storage required to represent that data. The hyphen points for a given word are represented as a variation on the hyphen points for the previous word represented in the data base. In this manner, it is only necessary to determine the relative position within the main dictionary of the word whose hyphen points are required and then to locate the corresponding position within the relational data base. On computer systems which have a minimum of available main storage, it is necessary to store dictionaries used for automatic hyphenation support on secondary storage devices. However, some of the computer systems which have word processing functions which could use this support also have a limited amount of available secondary storage. This double restriction, therefore, means that the storage technique used to store the hyphenation data associated with a dictionary word list must ensure the use of a minimum of both main and secondary storage. Further, because the dictionary to which the hyphenation data relates may be used for other purposes, the hyphenation data should be represented in such a way that functions not requiring its use not be penalized in storage use or performance by its presence. To obtain the hyphen points for a word, the data block containing the required hyphen point must first be read into main storage. The block location is determined by first locating the word in the main dictionary. This provides its relative word number within the dictionary. The index to the hyphenation data relational data base segment of the dictionary is then scanned. This index contains an entry indicating the range of main dictionary words whose hyphen masks exist on each relational data base data block. Thus, the exact data block needed can be determined, as well as the relative hyphenation data entry within the block. To minimize storage, the hyphen points for a...