Given a very large set of document, you can define the following relation
d_i ->; w_a, w_b, w_c, ......
meaning that the document d_i contains the word w_a, w_b, w_c, and so on and so forth
Suppose you want to invert the relation and build lists such as
w_a -> d_i, d_j, d_k ...
meaning that the word w_a is contained in documents d_i, d_j, d_k ...
how would you proceeed?
No comments:
Post a Comment