Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
elbows (0) - 7 freq elbow (1) - 18 freq errows (2) - 1 freq fellows (2) - 1 freq yellows (2) - 4 freq ellons (2) - 1 freq bows (2) - 11 freq elbaes (2) - 1 freq elbowin (2) - 4 freq slows (2) - 4 freq blows (2) - 12 freq flows (2) - 10 freq bellows (2) - 6 freq elbies (2) - 1 freq glows (2) - 6 freq elbas (2) - 9 freq allows (2) - 4 freq lows (2) - 1 freq ella's (3) - 10 freq kloods (3) - 1 freq albus (3) - 4 freq echos (3) - 2 freq egos (3) - 3 freq cows (3) - 5 freq nows (3) - 1 freq |
elbows (0) - 7 freq elbow (2) - 18 freq elbowin (3) - 4 freq elbies (3) - 1 freq allows (3) - 4 freq elbaes (3) - 1 freq elbas (3) - 9 freq lows (3) - 1 freq yellows (3) - 4 freq bows (3) - 11 freq laws (4) - 64 freq lowse (4) - 112 freq lowes (4) - 6 freq lobs (4) - 1 freq lbw (4) - 1 freq alba's (4) - 6 freq errows (4) - 1 freq albans (4) - 1 freq baws (4) - 93 freq yerbaws (4) - 1 freq ee-baws (4) - 1 freq elabwu (4) - 1 freq bowes (4) - 1 freq bellows (4) - 6 freq ellons (4) - 1 freq |
SoundEx code - E412 elbas - 9 freq elbows - 7 freq elvis - 11 freq elbuck - 13 freq elbucks - 6 freq elves - 10 freq elbaes - 1 freq elbock-cheer - 1 freq elbies - 1 freq elbick - 3 freq elbicks - 1 freq elbuk - 1 freq elipse - 1 freq elevkit - 1 freq elapse - 1 freq elfs - 1 freq elevicrkb - 1 freq elvis - 1 freq eilaubqdvm - 1 freq |
MetaPhone code - ELBS elbas - 9 freq elbows - 7 freq elbaes - 1 freq elbies - 1 freq |
ELBOWS |
Time to execute Levenshtein function - 0.180279 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.355199 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.027631 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.037803 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.000825 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. |