An OpenMP based solution for computing K-most frequent words in a corpus (see README for more). Also, my submission for Assignment 2 of Parallel Computing Course, BITS Pilani (2nd Sem 2017/18)
-
Updated
Mar 31, 2018 - C++
An OpenMP based solution for computing K-most frequent words in a corpus (see README for more). Also, my submission for Assignment 2 of Parallel Computing Course, BITS Pilani (2nd Sem 2017/18)
A Mini Search Engine in C++, using an inverted index and a trie.
Add a description, image, and links to the document-frequency topic page so that developers can more easily learn about it.
To associate your repository with the document-frequency topic, visit your repo's landing page and select "manage topics."