| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killers (0) - 9 freq fillers (1) - 1 freq killer (1) - 22 freq keillers (1) - 1 freq pillers (1) - 2 freq sillert (2) - 1 freq filters (2) - 3 freq kivvers (2) - 5 freq pillars (2) - 12 freq killins (2) - 1 freq kill's (2) - 1 freq kilter (2) - 4 freq kippers (2) - 7 freq siller's (2) - 4 freq billets (2) - 3 freq killed (2) - 81 freq fillets (2) - 3 freq kills (2) - 19 freq killen (2) - 4 freq gallers (2) - 25 freq tellers (2) - 5 freq killeen (2) - 1 freq miller (2) - 56 freq kivers (2) - 3 freq keller (2) - 1 freq |
killers (0) - 9 freq keillers (1) - 1 freq pillers (2) - 2 freq killer (2) - 22 freq fillers (2) - 1 freq bullers (3) - 2 freq keller (3) - 1 freq gallers (3) - 25 freq callers (3) - 2 freq tellers (3) - 5 freq cullers (3) - 1 freq sellers (3) - 2 freq kills (3) - 19 freq kelters (3) - 1 freq sillars (3) - 2 freq allers (3) - 1 freq rollers (3) - 5 freq pillars (3) - 12 freq killins (3) - 1 freq kill's (3) - 1 freq folloers (4) - 1 freq fillets (4) - 3 freq sellars (4) - 1 freq idlers (4) - 1 freq follyers (4) - 1 freq |
SoundEx code - K462 killers - 9 freq killerguile - 1 freq klieirs - 1 freq kilrogie - 17 freq keillers - 1 freq |
MetaPhone code - KLRS colours - 98 freq glouers - 1 freq glares - 7 freq clair's - 5 freq glorious - 58 freq 'glorious' - 1 freq collars - 8 freq killers - 9 freq couler's - 1 freq clears - 19 freq galleries - 8 freq culross - 2 freq glories - 9 freq calories - 11 freq galeries' - 1 freq callers - 2 freq colors - 1 freq klieirs - 1 freq culurs - 2 freq colour's - 1 freq glaur's - 1 freq glawrious - 1 freq colliers - 1 freq caloris - 2 freq coallieries - 1 freq clear's - 1 freq clours - 1 freq cullers - 1 freq gleers - 1 freq glaurs - 1 freq cllrs - 1 freq clooers - 1 freq keillers - 1 freq gallers - 25 freq |
KILLERS |
| Time to execute Levenshtein function - 0.391867 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.790083 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029281 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.149593 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001073 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |