| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ambushin (0) - 1 freq ambushit (1) - 1 freq smushin (2) - 4 freq ambushed (2) - 1 freq amusin (2) - 6 freq ambush (2) - 5 freq abusin (2) - 4 freq mashin (3) - 3 freq dushin (3) - 1 freq busin (3) - 1 freq wampishin (3) - 1 freq rushin (3) - 17 freq austin (3) - 5 freq ramshin (3) - 3 freq hushin (3) - 1 freq blushin (3) - 2 freq adjustin (3) - 6 freq wushin (3) - 4 freq crushin (3) - 5 freq amountin (3) - 1 freq amblin (3) - 3 freq abuin (3) - 346 freq gushin (3) - 4 freq grushin (3) - 1 freq fushin (3) - 19 freq |
ambushin (0) - 1 freq ambushit (2) - 1 freq ambush (3) - 5 freq ambushed (3) - 1 freq mashin (4) - 3 freq moshin (4) - 1 freq bashin (4) - 7 freq amusin (4) - 6 freq smushin (4) - 4 freq abusin (4) - 4 freq swushin (5) - 1 freq brushin (5) - 10 freq amaysin (5) - 1 freq muslin (5) - 2 freq cushin (5) - 3 freq amaisin (5) - 1 freq flushin (5) - 5 freq moshun (5) - 1 freq manishin (5) - 1 freq shushin (5) - 1 freq fushin (5) - 19 freq smashin (5) - 60 freq buskin (5) - 11 freq coushin (5) - 1 freq pushin (5) - 64 freq |
SoundEx code - A512 ambassador - 9 freq ambushin - 1 freq ambushit - 1 freq ambush - 5 freq ambiguities - 1 freq ambcetion - 1 freq ambassadors - 9 freq ambiguity - 2 freq amboise - 3 freq ambassadoriall - 1 freq ambiguous - 2 freq ambushed - 1 freq anivjcczx - 1 freq anapests - 1 freq anabwkjpkw - 1 freq |
MetaPhone code - AMXN ambushin - 1 freq ambeetion - 7 freq ambition - 16 freq ambeition - 2 freq ambeitioun - 1 freq |
AMBUSHIN |
| Time to execute Levenshtein function - 0.198138 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.356377 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.027820 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.037296 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.000998 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. |