Skip to content
#

boyer-moore

Here are 51 public repositories matching this topic...

Around 35 of the fastest and most widely used full text search algorithms. Written in c, compiled with llvm.clang for iOS and everything else. Boyer-Moore , Knuth-Morris-Pratt, Reverse Colussi even the Zhu-Takaoka algorithm. And 32 more.

  • Updated Aug 16, 2019
  • Objective-C

Real-time writing prediction and correction model based on the trie data structure, the Boyer-Moore algorithm for string matching, and the Levenshtein distance (using dynamic programming) for string similarity. This was designed and implemented as the final project of the "Design and Analysis of Algorithms" and "Programming for Data Analysis" cl…

  • Updated Dec 14, 2020
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the boyer-moore topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the boyer-moore topic, visit your repo's landing page and select "manage topics."

Learn more