| 97 |
then to satisfy the K 1 AND K 2 part we intersect the K 1 and K 2 lists,to satisfy the K 3 AND NOT K 4 part we subtract the K 4 list from the K 3 list
...A slight modification of the full Boolean search is one which only allows AND logic but takes account of the actual number of terms the query has in common with a document
...For the same example as before with the query Q K 1 AND K 2 AND K 3 we obtain the following ranking:Co ordination level 3 D 1,D 2 2 D 3 1 D 4 In fact,simple matching may be viewed as using a primitive matching function
...Matching functions Many of the more sophisticated search strategies are implemented by means of a matching function
...There are many examples of matching functions in the literature
...If M is the matching function,D the set of keywords representing the document,and Q the set representing the query,then: |
