GitHub - AMGIRI-1996/BestSearchEngine: This is a long debating question in developing algorithm for search engines. The idea behind this one is very simple. Every search engine uses algorithm like HITS or page ranking with some own modification and features such as spelling checking and correcting most search matching etc... so for a query different search engines gives the best match according to their best algorithm. So if there is a common result it must be the best as it is best according to these best algorithms. Second question comes prioritizing the results. Idea used in this is to give preference according to number of intersection and results having same number of intersection will be sorted according to engine's priority. This can be decided using machine learning.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
__pycache__		__pycache__
bing.py		bing.py
google.py		google.py
main.py		main.py
yahoo.py		yahoo.py

About

This is a long debating question in developing algorithm for search engines. The idea behind this one is very simple. Every search engine uses algorithm like HITS or page ranking with some own modification and features such as spelling checking and correcting most search matching etc... so for a query different search engines gives the best matc…

search-engine searching-algorithms