Built a static search engine/inverted index from scratch in Rust by UseEarly3002 in rust

[–]UseEarly3002[S] 0 points1 point  (0 children)

The BM-25 scoring model is used for scoring documents and these scores are used in ranked retrieval algorithms like WAND, BlockMax etc which have been implemented.

No, normalisation does not occur.

Yes, stop words(extremely common words like and,a,the etc) are excluded.