Kombinatorische evaluatie van Boolefunkties.

Author(s)
Heer, T. de.
Year
Abstract

For information retrieval the questions are mostly set up in the form of Boolean functions. The enquiry language is the spelling of a Boolean function. When an information retrieval system operates on documents written in natural language, the Boolean variables are mostly language or word fragments, which are called terms. The system tries to find these terms in the data base. An evaluation of Boolean functions is presented.

Request publication

4 + 3 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
B 17417 S /01/
Source

Den Haag, Instituut voor Wiskunde Informatieverwerking en Statistiek IWIS-TNO, 1977, 15 p., ref.; Mededeling No. 16.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.