This implementation uses the famous Term Frequency - Inverse Document Frequency Algorithm which is responsible for creating a great search engine. In this example, the user can use a local folder of documents (books, papers etc.) where he can use a string query as an input to search a specific word or even a sentance inside these documents. The output will show a list of the most relevant content of those documents based on the searched query. Thanks to the score mechanism of the algorithm, we can have precise results of what we are searching for inside these documents.
-
Notifications
You must be signed in to change notification settings - Fork 0
TheCodingStache/DocumentSearch
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Term Frequency - Inverse Document Frequency Algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published