| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ransackin (0) - 1 freq ransacked (2) - 2 freq ransack (2) - 1 freq knoackin (3) - 5 freq sackin (3) - 4 freq faackin (3) - 2 freq unpackin (3) - 1 freq transaction (3) - 6 freq ransellin (3) - 1 freq rackin (3) - 8 freq panickin (3) - 3 freq rankin (3) - 16 freq knackin (3) - 1 freq enackin (3) - 2 freq carsackie (3) - 1 freq attackin (3) - 8 freq translatin (4) - 6 freq canvassin (4) - 3 freq attackin' (4) - 1 freq roakin (4) - 1 freq oangawin (4) - 1 freq rockin (4) - 18 freq unpackit (4) - 1 freq racklin (4) - 3 freq hanselin (4) - 1 freq |
ransackin (0) - 1 freq ransacked (3) - 2 freq ransack (3) - 1 freq panickin (5) - 3 freq rackin (5) - 8 freq enackin (5) - 2 freq ransellin (5) - 1 freq rankin (5) - 16 freq knackin (5) - 1 freq transaction (5) - 6 freq knoackin (5) - 5 freq sackin (5) - 4 freq unpackin (5) - 1 freq nickin (6) - 8 freq refleckin (6) - 4 freq unlockin (6) - 2 freq unpickin (6) - 1 freq respeckin (6) - 2 freq neckin (6) - 3 freq rinsin (6) - 3 freq reckin (6) - 5 freq rinkin (6) - 1 freq riskin (6) - 5 freq rescuin (6) - 1 freq sneckin (6) - 7 freq |
SoundEx code - R522 rinses - 1 freq ramshackle - 6 freq ransacked - 2 freq ramseys - 1 freq rummages - 1 freq ringostar - 2 freq 'ramshackle - 1 freq reenges - 4 freq runcigill - 1 freq ranges - 2 freq ramsay's - 6 freq raingeese - 1 freq reinges - 5 freq ransack - 1 freq reimishis - 1 freq reneges - 1 freq re-engaged - 1 freq ransackin - 1 freq ryankeckler - 1 freq ronnycostello - 1 freq renniesusanc - 12 freq renniesusanc's - 1 freq ryanmcguigan - 1 freq |
MetaPhone code - RNSKN ransackin - 1 freq |
RANSACKIN |
| Time to execute Levenshtein function - 0.231271 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.385076 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.029374 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.040033 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.001158 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. |