| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quarrels (0) - 1 freq quarrel (1) - 4 freq quares (2) - 1 freq quarry's (2) - 4 freq quarries (2) - 4 freq quarely (2) - 5 freq quarters (2) - 16 freq squirrels (2) - 20 freq farrels (2) - 1 freq quarrelan (2) - 2 freq barrels (2) - 18 freq quare'n (3) - 1 freq squarely (3) - 3 freq squares (3) - 17 freq quaarters (3) - 2 freq hurrelt (3) - 1 freq quaters (3) - 1 freq quires (3) - 1 freq laurels (3) - 2 freq burrel (3) - 1 freq quarter (3) - 68 freq quaaters (3) - 5 freq quatre (3) - 1 freq wursels (3) - 7 freq murrel (3) - 1 freq |
quarrels (0) - 1 freq quarrel (2) - 4 freq farrels (3) - 1 freq quarrelan (3) - 2 freq squirrels (3) - 20 freq barrels (3) - 18 freq quarry's (3) - 4 freq quarries (3) - 4 freq quarters (4) - 16 freq quares (4) - 1 freq quarely (4) - 5 freq oursels (5) - 3 freq quarrelled (5) - 2 freq quarry (5) - 61 freq quarts (5) - 1 freq farrell (5) - 1 freq barrens (5) - 1 freq wurzels (5) - 1 freq quarterly (5) - 3 freq quarter's (5) - 1 freq queries (5) - 1 freq squirrelt (5) - 1 freq orrals (5) - 13 freq horrals (5) - 1 freq squirrel (5) - 43 freq |
SoundEx code - Q642 queer-lookin - 1 freq queer-luikin - 1 freq queerluikin - 1 freq queer-like - 5 freq queerlike - 3 freq queer-leukin - 1 freq queer-lookan - 1 freq queer-lyeukin - 1 freq quarrels - 1 freq queerlik - 1 freq |
MetaPhone code - KRLS careless - 10 freq curls - 37 freq carroll's - 1 freq growls - 14 freq gurls - 1 freq creels - 24 freq carlie's - 1 freq carlo's - 2 freq carles - 6 freq creel's - 3 freq grilsie - 1 freq carlos - 3 freq gorilla's - 1 freq gorillas - 2 freq curlew's - 1 freq crowls - 1 freq carl's - 1 freq kerless - 1 freq crewless - 1 freq crawls - 1 freq craals - 1 freq carols - 3 freq quarrels - 1 freq creils - 1 freq crawlies - 1 freq garrulous - 1 freq grals - 1 freq craalies - 3 freq karlas - 1 freq carrolls - 1 freq curlysoo - 1 freq carls - 1 freq curlews - 1 freq |
QUARRELS |
| Time to execute Levenshtein function - 0.219061 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.419084 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.028411 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.037341 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.000892 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. |