Persian Search Engine, Project of Information Retrieval Course
This project is an implementation of an information retrieval system using a large dataset of a Persian news agency documents.
-
Normalization
-
Extracting Tokens
-
Removing Stopwords
-
Stemming
-
Checking Heaps' Law and Zipf's Law Before and After Stemming
Result of Zipf's Law:
Result of Heaps' Law:- Normal Queries
- Phrase Queries
- Boolean Queries (NOT)
- Combination of All Types of Queries
The aim of this part is representing queries and documents as vectors to achieve more precise results. Documents are ranked according to their proximity to the query in the vector space. This includes the following steps:
- tf–idf weighting
- Ranking documents based on cosine similarity
- Speeding cosine computation by pruning:
- Index elimination
- Champion list