Lawrence J. Mazlack
Abstract
Unidirectional trees and lattices may both be used to hold a symbolic data base consisting of lexes, lexemes or other symbol strings. This paper empirically compares placing symbolic information into both trees and lattices (a lattice may be thought of as a unidirectional network with single and initiating and terminating nodes).
- A. T. Bertiss, DATA STRUCTURES: THEORY AND PRACTICE, Academic Press, New York, 1971, p. 129+. Google Scholar
Digital Library
- R. de la Briandis, Proc. Western Joint Computer Conf. 15, 1959, pp. 295-298.Google Scholar
- M. J. Eisner, D. G. Severance, "Mathematical Techniques for Efficient Record Segmentation In Large Schared Data Bases," JACM, v. 23, no. 4, October, 1976, pp. 619-635. Google ScholarDigital Library
- E. Fredkin, CACM, 3, 1960, pp. 490-500. Google ScholarDigital Library
- G. D. Knott, "Hashing Functions," Computer J, v. 18, no. 3, 1975, pp. 265-278.Google Scholar
- Knuth, SORTING AND SEARCHING, (THE ART OF COMPUTER PROGRAMMING, vol. 3), Addison-Wesley, Reading, Mass., 1973, p. 481+. Google ScholarDigital Library
- M. Lamb, H. Jacobsen, "A High Speed Large Capacity Dictionary System", Mechanical Translation, vol. 6, November, 1961, pp. 66-107.Google Scholar
- L. J. Mazlack, "An Investigation of Computer Generated Crossword Puzzle Techniques," Dissertation, Washington University (St. Louis), December 1972. Google ScholarDigital Library
- Websters Elementary Dictionary, G. C. Merriam Co., Springfield, Mass., 1971.Google Scholar
Index Terms
- An empirical comparison: tree and lattice structures for symbolic data bases
Recommendations
An empirical comparison: tree and lattice structures for symbolic data bases
SIGIR '79: Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eightiesUnidirectional trees and lattices may both be used to hold a symbolic data base consisting of lexes, lexemes or other symbol strings. This paper empirically compares placing symbolic information into both trees and lattices (a lattice may be thought of ...
Overview and comparison of localic and fixed-basis topological products
This paper studies localic products, traditional topological products, and L-topological products, and gives a complete outline of the localic product. Comparisons of localic and L-topological products are generally absent in the literature, and this ...
Commutative pseudo-equality algebras
Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvureăźenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the ...
Comments