Skip to content

Persian Search Engine, Project of Information Retrieval Course

Notifications You must be signed in to change notification settings

tanya-jp/Search-Engine

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

Search-Engine

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.

Document Preprocessing

  • 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:

Positional index construction

Query processing

  • 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:

  1. tf–idf weighting
  2. Ranking documents based on cosine similarity
  3. Speeding cosine computation by pruning:
  • Index elimination
  • Champion list

About

Persian Search Engine, Project of Information Retrieval Course

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages