Thumbnail
Access Restriction
Subscribed

Author Hutton, Fred C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Natural language searching ♦ Peekaboo ♦ Superimposed coding ♦ Computer search technique ♦ Information compaction ♦ Text searching
Abstract The “peekaboo” idea from punched card information retrieval methods has been mated with the idea of superimposed punching to produce a programming technique which cuts computer run time in half on a test search of 33,000 subject index entries. A search program using the device has been operational since late 1963. As an item is entered in the store, an 18-byte mask is created from the item's meaningful words using the inclusive OR operation. If, at search time, the logical product (using the AND operation) of this mask and a similarly constructed question mask is not equal to the question mask, then one or more question words are not present in the store item. An equality is inconclusive; the words of the store item must be unpacked and compared with question words. The present store is made up of over 600,000 subject index entries estimated to average 60 characters each. Longer texts, such as abstracts, could be handled by multiple masks.
Description Affiliation: Union Carbide Corp., Oak Ridge, TN (Hutton, Fred C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 11
Issue Number 9
Page Count 4
Starting Page 595
Ending Page 598


Open content in new tab

   Open content in new tab
Source: ACM Digital Library