To read this content please select one of the options below:

Generation of fixed‐length search codes from INSPEC words using techniques based on variety generation and on division‐hashing

David Cooper (Postgraduate School of Librarianship and Information Science, University of Sheffield, Western Bank, Sheffield, S10 2TN, England)
Michael F. Lynch (Postgraduate School of Librarianship and Information Science, University of Sheffield, Western Bank, Sheffield, S10 2TN, England)
Alice H.W. McLure (Postgraduate School of Librarianship and Information Science, University of Sheffield, Western Bank, Sheffield, S10 2TN, England)

Program: electronic library and information systems

ISSN: 0033-0337

Article publication date: 1 April 1981

16

Abstract

The use of variety generation techniques in the production of fixed‐length degenerate representations for search terms is compared with methods based on division‐hashing. For files of words taken from INSPEC data, the latter perform better, almost certainly because of dependence between assignments of symbol sets. Attempts to overcome the problem produced no real improvement, possibly because the decrease in dependence was accompanied by an increased skewness in the distribution of symbols.

Citation

Cooper, D., Lynch, M.F. and McLure, A.H.W. (1981), "Generation of fixed‐length search codes from INSPEC words using techniques based on variety generation and on division‐hashing", Program: electronic library and information systems, Vol. 15 No. 4, pp. 226-232. https://doi.org/10.1108/eb046835

Publisher

:

MCB UP Ltd

Copyright © 1981, MCB UP Limited

Related articles