| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amboise (0) - 3 freq ambroise (1) - 2 freq ameise (2) - 1 freq amyoose (2) - 1 freq aboose (2) - 1 freq abuise (2) - 3 freq ambros (3) - 1 freq rmhoose (3) - 1 freq aywise (3) - 1 freq ambles (3) - 2 freq ammonite (3) - 1 freq aawise (3) - 1 freq anbile (3) - 1 freq noise (3) - 152 freq abie (3) - 1 freq amblin (3) - 3 freq amitie (3) - 5 freq abuised (3) - 1 freq brise (3) - 1 freq poise (3) - 3 freq mouse (3) - 32 freq moose (3) - 378 freq acoorse (3) - 7 freq acrose (3) - 1 freq amble (3) - 3 freq |
amboise (0) - 3 freq ambroise (2) - 2 freq abuise (3) - 3 freq aboose (3) - 1 freq ameise (3) - 1 freq amyoose (3) - 1 freq albais (4) - 1 freq impose (4) - 10 freq abuse (4) - 46 freq morse (4) - 3 freq maise (4) - 2 freq amble (4) - 3 freq imbibe (4) - 1 freq muise (4) - 1 freq bose (4) - 19 freq amiss (4) - 16 freq jambos (4) - 3 freq boose (4) - 2 freq abase (4) - 1 freq moose (4) - 378 freq ameuse (4) - 1 freq absie (4) - 1 freq ambles (4) - 2 freq amuse (4) - 8 freq mbs (4) - 2 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 - AMS amuse - 8 freq awmous - 4 freq aims - 14 freq a-miss - 1 freq amaze - 4 freq aums - 1 freq amiss - 16 freq amos - 3 freq am's - 2 freq aamos - 5 freq amboise - 3 freq ameise - 1 freq ameuse - 1 freq aimee's - 1 freq amys - 1 freq ammys - 1 freq |
AMBOISE |
| Time to execute Levenshtein function - 0.229121 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.391511 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.037047 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.039062 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.001002 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. |