| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clippins (0) - 1 freq clippin (1) - 12 freq chippin (2) - 7 freq clippit (2) - 5 freq clapping (2) - 3 freq clippie (2) - 2 freq chipping (2) - 1 freq clippie' (2) - 1 freq lippens (2) - 24 freq lippin (2) - 9 freq flipping (2) - 1 freq clippers (2) - 6 freq lippies (2) - 1 freq slipping (2) - 3 freq chippies (2) - 1 freq clipin (2) - 1 freq pippins (2) - 1 freq flippin's (2) - 1 freq clappin (2) - 46 freq flippin (2) - 7 freq hippins (2) - 3 freq clippan (2) - 3 freq slippin (2) - 28 freq rippin' (3) - 1 freq schippis (3) - 1 freq |
clippins (0) - 1 freq clippin (2) - 12 freq clippan (3) - 3 freq lippens (3) - 24 freq clippers (3) - 6 freq clapping (3) - 3 freq clappin (3) - 46 freq pippins (4) - 1 freq flippin (4) - 7 freq slippin (4) - 28 freq clappan (4) - 2 freq clappers (4) - 12 freq clipin (4) - 1 freq hippins (4) - 3 freq flippin's (4) - 1 freq clippie (4) - 2 freq chippies (4) - 1 freq chippin (4) - 7 freq clippit (4) - 5 freq chipping (4) - 1 freq clippie' (4) - 1 freq slipping (4) - 3 freq flipping (4) - 1 freq lippies (4) - 1 freq lippin (4) - 9 freq |
SoundEx code - C415 clappin - 46 freq clypin - 8 freq cloven - 5 freq clephant - 1 freq calvin's - 3 freq calvin - 8 freq 'cellophane' - 1 freq clip-ma-clash - 1 freq clippins - 1 freq clippin - 12 freq clubbin' - 1 freq cluifmerks - 1 freq clapp'n - 1 freq coolfin - 1 freq clippan - 3 freq calfan - 1 freq calvinisticallie - 1 freq calvinist - 3 freq culfin - 1 freq chilbiains - 1 freq clip-on - 2 freq clubbin - 1 freq clappan - 2 freq cellophane - 1 freq colvend - 2 freq calaphine - 2 freq cleavin - 1 freq calvinists - 1 freq calvinism - 1 freq colvin - 1 freq cliveyoungscots - 1 freq calvinclyne - 1 freq clyping - 1 freq clipin - 1 freq claping - 1 freq clapping - 3 freq |
MetaPhone code - KLPNS clippins - 1 freq |
CLIPPINS |
| Time to execute Levenshtein function - 0.377043 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.591349 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.027799 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.075458 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.001374 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. |