| http://www.w3.org/ns/prov#value | - o be tested, and the highest ranking documents are returned at block 30. [0029] One non-limiting distance function F is given as follows: [0030] F(Q,D)=([summation of i from 1 to k]w(qi, nji)p)1/p, wherein D is a document that includes m numbers ni, Q is a query that includes k numbers q1, . . . , qk such that there is a set of matching document numbers nj1, . . . , njk in the jth document, w(qi,
|
