CLASSIFICATION SPACE ANALYSIS
Abstract
A conceptual approach to linguistic data processing problems is sketched and empirical illustrations are presented of the major software components - indexing, storage, and retrieval - of a document processing system which offers, in principle, the advantages of complete automation, unlimited cross-indexing, effective sequential retrieval, subdocumentary indexing reflecting heterogeneity of subject matter within a document, and a procedure for automatically identifying retrieval requests which would be inadequately handled by the system. The indexing scheme, designated as a 'Classification Space' consists of a Euclidean model for mapping subject matter similarity within a given subject matter domain. A scheme of this kind is empirically derived for certain fields of Engineering and Chemistry. A set of five related empirical studies provide convincing evidence that when appropriate experimental procedures are followed a very stable C-Space for a given content domain can be constructed on a surprisingly small data base. Other empirical studies demonstrate specific computational procedures for effective automatic indexing of documents in a C-Space, using a relatively small system vocabulary.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1964
- Accession Number
- AD0608034
Entities
People
- Peter Ossorio
Organizations
- University of Colorado Boulder