| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| polar (0) - 24 freq polnar (1) - 1 freq solar (1) - 23 freq poplar (1) - 1 freq powlar (1) - 1 freq pola (1) - 6 freq poal (2) - 1 freq poap (2) - 1 freq 'ola' (2) - 1 freq polvara (2) - 2 freq colas (2) - 1 freq glar (2) - 7 freq coar (2) - 3 freq bolas (2) - 4 freq poat (2) - 3 freq porr (2) - 1 freq poplars (2) - 2 freq olav (2) - 1 freq velar (2) - 7 freq poser (2) - 2 freq voar (2) - 46 freq zola (2) - 1 freq plan (2) - 236 freq polaris (2) - 3 freq cola (2) - 10 freq |
polar (0) - 24 freq pler (2) - 1 freq pola (2) - 6 freq powlar (2) - 1 freq polnar (2) - 1 freq solar (2) - 23 freq poplar (2) - 1 freq pear (3) - 9 freq poll (3) - 42 freq colair (3) - 1 freq pilau (3) - 2 freq por (3) - 2 freq pelao (3) - 1 freq po'er (3) - 2 freq poer (3) - 1 freq plaw (3) - 1 freq color (3) - 2 freq pouer (3) - 151 freq pillar (3) - 15 freq poller (3) - 1 freq poles (3) - 30 freq polly (3) - 12 freq plav (3) - 1 freq pypar (3) - 1 freq pol (3) - 4 freq |
SoundEx code - P460 pillar - 15 freq player - 131 freq pallor - 4 freq polar - 24 freq puller - 1 freq pleyer - 2 freq powlar - 1 freq pleyar - 1 freq pullar - 5 freq peeler - 3 freq poller - 1 freq pleure - 1 freq pler - 1 freq |
MetaPhone code - PLR pillar - 15 freq pallor - 4 freq polar - 24 freq puller - 1 freq powlar - 1 freq pullar - 5 freq peeler - 3 freq poller - 1 freq pleure - 1 freq pler - 1 freq |
POLAR |
| Time to execute Levenshtein function - 0.253465 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.403380 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.028674 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.037294 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.000924 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. |