Implementing the Porter stemming algorithm in JavaScript
Learn how to implement the Porter stemming algorithm in JavaScript, a simple algorithm for stripping English words of common suffixes.
Ever wondered how search engines work? Maybe you always wanted to build one of your own? This collection will teach you some fundamental techniques involved in indexing and searching through collections of documents, using plain JavaScript and natural language processing (NLP).
Learn how to implement the Porter stemming algorithm in JavaScript, a simple algorithm for stripping English words of common suffixes.
Building on top of the Porter stemmer, we'll explore how to use TF-IDF and an inverted index to implement a search algorithm in JavaScript.
Building on top of the TF-IDF and inverted index implementation, we will implement partial search matching to make searching more robust.
Having built a search engine with TF-IDF and inverted indexes, we will now implement fuzzy matching to make searching error-tolerant.