| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voicer (0) - 1 freq voiced (1) - 16 freq voice (1) - 828 freq voices (1) - 113 freq volce (2) - 1 freq voicees (2) - 1 freq voican (2) - 1 freq juicer (2) - 1 freq voter (2) - 11 freq veice (2) - 2 freq slicer (2) - 1 freq loiter (2) - 1 freq voocher (2) - 1 freq vice (2) - 66 freq vice- (2) - 1 freq vaiger (2) - 1 freq voices- (2) - 3 freq voiee (2) - 1 freq viper (2) - 1 freq voce (2) - 6 freq vices (2) - 12 freq nicer (2) - 6 freq voucher (2) - 8 freq voicin (2) - 1 freq vicar (2) - 1 freq |
voicer (0) - 1 freq voiced (2) - 16 freq vicar (2) - 1 freq voices (2) - 113 freq voice (2) - 828 freq voucher (3) - 8 freq nicer (3) - 6 freq viper (3) - 1 freq voicin (3) - 1 freq voce (3) - 6 freq voyce (3) - 4 freq vcr (3) - 1 freq voger (3) - 1 freq viceroy (3) - 1 freq voyces (3) - 1 freq vices (3) - 12 freq juicer (3) - 1 freq veice (3) - 2 freq voican (3) - 1 freq voter (3) - 11 freq voocher (3) - 1 freq voicees (3) - 1 freq vice- (3) - 1 freq vice (3) - 66 freq vaiger (3) - 1 freq |
SoundEx code - V260 viceroy - 1 freq vcr - 1 freq voocher - 1 freq voicer - 1 freq voucher - 8 freq vouchir - 5 freq vigour - 6 freq viagra - 4 freq visor - 2 freq voyager' - 1 freq voger - 1 freq veisre - 1 freq vyce-ower - 1 freq voyager - 1 freq veesior - 1 freq vissier - 1 freq vicar - 1 freq vaiger - 1 freq vogrie - 2 freq vickyra - 1 freq vqrra - 1 freq |
MetaPhone code - FSR viceroy - 1 freq facer - 2 freq voicer - 1 freq fizzer - 6 freq fissure - 1 freq visor - 2 freq fozier - 1 freq veisre - 1 freq vissier - 1 freq |
VOICER |
| Time to execute Levenshtein function - 0.798614 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 - 1.489319 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.103394 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.103619 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.000854 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. |