The usefulness of basic intersections and of the probability measure of sets for the formulation of document and search specifications in coordinate indexing systems is discussed. It is possible to formulate a search equation representing accurately the matching procedure between the specification of the request and that of the file item. The equation contains, besides the usual set of descriptive terms, a part comprising a matrix formulation of the truth tables of the file item and of the request. Through an operation between these matrix representations a new truth table referring to the subset of descriptive terms that are common to both, the request and the file item, is generated. The equation produces, furthermore, a general and quantitative criterion of relevance between request and file item. Certain numerical values of this criterion may be specified in advance, and thus the search operation may be controlled at will.
A general method for matching specifications in mechanized retrieval systems is presented. It is based on the principle that, with the initiation of the matching operation, to each characteristic or descriptor a unique code consisting of a power of two in binary notation is assigned. These codes may, if so desired, be interpreted as implicit weight coefficients of the descriptors. They are used in matching operations between sets of characteristics. The matching process produces during its progress criteria as to the relations between involved sets, i.e., a numerical critèrion of relevance of the answer to the query, which may be utilized to control the course of the operation. In a second step, new secondary codes are derived mechanically from those assigned initially. The function of the secondary codes is to transform the original statement into the second canonical form, consisting of the disjunction of mutually exclusive basic conjunctions or propositions. These secondary codes are employed to generate by logical multiplication, addition, and negation unique code representations for arbitrary compound statements or propositions, which representations in their turn are employed for matching the statements. The process generates criteria in analogy to those obtained in the first step of matching sets of characteristics which now permit the control of the matching operations between arbitrary propositions. It should be mentioned that no significance is assigned a priori to the codes. Their relative significance is restricted entirely to the matching operation actually in progress.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.