| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tatterwallopie (0) - 1 freq tatterwallop (2) - 1 freq tatterwalloppy (2) - 1 freq naitrallie (6) - 1 freq leiterallie (6) - 2 freq caterwaulin (6) - 2 freq catterwa'in (6) - 1 freq watter-wall (6) - 1 freq naiturallie (6) - 2 freq tattered-lookin (6) - 1 freq tatterie (6) - 1 freq latterlie (6) - 2 freq butterflie (7) - 2 freq natterie (7) - 1 freq wattermill (7) - 1 freq akwallie (7) - 2 freq tattle-tale (7) - 1 freq capercallies (7) - 1 freq wattermelon (7) - 1 freq atterie (7) - 4 freq waterfalls (7) - 1 freq tantallon (7) - 2 freq trollope (7) - 2 freq watterloony (7) - 69 freq haute-savoie (7) - 1 freq |
tatterwallopie (0) - 1 freq tatterwallop (2) - 1 freq tatterwalloppy (3) - 1 freq watter-wall (9) - 1 freq wattermill (10) - 1 freq watterfaalls (10) - 1 freq watter-well (10) - 1 freq trollope (10) - 2 freq tatterie (10) - 1 freq latterlie (10) - 2 freq tattered-lookin (10) - 1 freq caterwaulin (10) - 2 freq catterwa'in (10) - 1 freq leiterallie (10) - 2 freq naiturallie (10) - 2 freq naitrallie (10) - 1 freq totallie (11) - 1 freq teeterlogic (11) - 2 freq culturallie (11) - 1 freq watterfaals (11) - 1 freq waterfall (11) - 2 freq wattertap (11) - 1 freq watter-wal (11) - 1 freq motherwells (11) - 1 freq materially (11) - 1 freq |
SoundEx code - T364 tutorials - 3 freq tatterwallop - 1 freq tither'll - 1 freq tatterwallopie - 1 freq teeterlogic - 2 freq tatterwalloppy - 1 freq that-relativisation - 2 freq tutorial - 2 freq thederrywalls - 1 freq |
MetaPhone code - TTRWLP tatterwallop - 1 freq tatterwallopie - 1 freq tatterwalloppy - 1 freq |
TATTERWALLOPIE |
| Time to execute Levenshtein function - 0.235081 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.396092 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.028299 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.037738 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.000965 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. |