[login to view URL]
I've done the work
but I need help with debugging
[login to view URL], [login to view URL], invertedIndex.h
These are my work files.
List.c , List.h , Tree.c, Tree.h
You need to implement the required functions in the file invertedIndex.c that reads data from a given collection of files in [login to view URL]
(see simple example files) and generates an "inverted index" that provides a sorted list (set) of filenames for every word in a given collection of
files. You need to use binary search ADT to implement your inverted index. For more information on this, please see the following hints:
"How to Implement Ass1"
We will also discuss the above hints in the lecture. Please note that each list of filenames (for a single word) in your inverted index should be
alphabetically ordered, using ascending order, and importantly duplicate filenames are not allowed.
In this part, you need to implement an information retrieval function that finds files (documents) with one or more query terms, and uses the
summation of tf-idf values of all matching query terms (words) for ranking such files (documents). You need to calculate the tf-idf value for
each matching query term in a file (document), and rank files (documents) based on the summation of tf-idf values for all matching query
terms present in that file. Use the "inverted index" you created in Part 1 to locate files with one or more query terms and calculate the required
tf-idf values for such files.