4 ms·
Does this approach have a name? It looks familiar, but I can't place it.
by scoot 15y ago
Does this approach have a name? It looks familiar, but I can't place it.
- pkghost 15y agoReminds me of term frequency-inverse document frequency (http://en.wikipedia.org/wiki/Tf*idf http://en.wikipedia.org/wiki/Tf*idf) which can be used with cosine similarity to compute something that approximates the "semantic" relatedness of documents. Example and more algo details here: http://www.exsupera.com/sandbox/DCM/html/document.py?id=3 http://www.exsupera.com/sandbox/DCM/html/document.py?id=3
- Dn_Ab 15y agoAlthough it sometimes gives similar results, its not tf-idf. It is simpler so faster for this task. If it has a name I don't know it, its just an idea I had: Sentences with the most uncertainty associated with them with respect to the document should be the most interesting/relevant.