LevenSearch sɣur Chris
A fuzzy finder that searches for strings using Levenshtein distance.
Ilaq-ak·am Firefox i useqdec n usiɣzef-a
Asiɣzef aɣefisefka
Ɣef usiɣzef agi
A simple tool to search approximate matches to a string in web pages. Uses Levenshtein automaton to do this
fairly efficiently.
I mostly built this for myself to search large Wikipedia articles for technical terms that I didn't *quite* remember how to spell.
fairly efficiently.
I mostly built this for myself to search large Wikipedia articles for technical terms that I didn't *quite* remember how to spell.
Sezmel tarmit-ik
TisiragIssin ugar
Azegrir-a yesra:
- Kcem ɣer isefka-inek deg ismal web meṛṛa
Ugar n telɣut
- Lqem
- 0.9
- Teɣzi
- 13,39 KB
- Aleqqem aneggaru
- 4 χρόνια πριν (3 Απρ 2021)
- Taggayin i ilan assaɣ
- Turagt
- GNU General Public License v3.0 only
- Amazray n Lqem
Rnu ar tegrumma
Tizmilin n tuffɣa n 0.9
Not rigorously tested, but is working. Contains an implementation of Levenshtein automata (with just NFAs) and an alternative dynamic programming approach.
Future versions may contain more algorithms and may allow users to switch between algorithms.
Future versions may contain more algorithms and may allow users to switch between algorithms.
Ugar n isiɣzaf sɣur Chris
Ulac tazmilt akka tura- Ulac tazmilt akka tura
- Ulac tazmilt akka tura
- Ulac tazmilt akka tura
- Ulac tazmilt akka tura
- Ulac tazmilt akka tura