Abstract
AbstractEfforts to devise a calculus adequate as a foundation for information retrieval have taken a number of forms. Semantic and signal information theory have in common the mathematical model consisting of an n‐dimensional Euclidean space. In semantic information theory, however, probability plays no part. What is of interest are those codes in which the transformed space is isomorphic to the original space under transformation and which preserve a “match” relation. Code transformations are applied separately to each document and query vector in the system, and those documents which match a given query vector before the transformation must do so afterwards. Query vectors are distinguished from document vectors by the inclusion of one or more “joker” symbols which match all codes in the given vector position.A major distinction between the communication and information retrieval context is shown in that, contrary to the former, shortened codes are only achieved at the cost of information in the latter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
