Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
leeved (0) - 55 freq reeved (1) - 2 freq leeded (1) - 1 freq leeed (1) - 1 freq leeted (1) - 1 freq peeved (1) - 4 freq leeve (1) - 81 freq sleeved (1) - 3 freq leeven (1) - 2 freq deeved (1) - 6 freq leesed (1) - 1 freq leeves (1) - 19 freq lee'ed (1) - 1 freq gleeved (1) - 1 freq meeved (1) - 22 freq leived (1) - 11 freq leered (1) - 1 freq leided (2) - 1 freq deeves (2) - 1 freq gleened (2) - 1 freq cleaved (2) - 2 freq keeped (2) - 1 freq leaven (2) - 1 freq reeted (2) - 4 freq sleeve (2) - 46 freq |
leeved (0) - 55 freq leived (1) - 11 freq meeved (2) - 22 freq gleeved (2) - 1 freq lee'ed (2) - 1 freq levied (2) - 1 freq luved (2) - 70 freq lived (2) - 145 freq leeves (2) - 19 freq leered (2) - 1 freq loved (2) - 186 freq leeted (2) - 1 freq leeded (2) - 1 freq reeved (2) - 2 freq leeed (2) - 1 freq peeved (2) - 4 freq leesed (2) - 1 freq leeven (2) - 2 freq deeved (2) - 6 freq leeve (2) - 81 freq sleeved (2) - 3 freq leev (3) - 3 freq leared (3) - 1 freq leave (3) - 447 freq heaved (3) - 6 freq |
SoundEx code - L130 left - 1563 freq luved - 70 freq loved - 186 freq lowped - 64 freq lowpit - 72 freq lowpt - 23 freq lived - 145 freq lift - 490 freq leived - 11 freq lft - 2 freq leeft - 11 freq leapt - 11 freq loft - 13 freq loupit - 30 freq louped - 17 freq leeved - 55 freq libbit - 3 freq luft - 2 freq life'd - 1 freq lapped - 4 freq laft - 26 freq lipt - 1 freq loupt - 2 freq leave't - 2 freq lowp't - 2 freq looped - 2 freq loppit - 1 freq luvit - 1 freq lippit - 2 freq lappit - 7 freq leviet - 1 freq leevit - 4 freq leyft - 1 freq lyfboat - 1 freq loupet - 2 freq laift - 1 freq lyft - 2 freq life-wat - 1 freq libbed - 1 freq lapd - 1 freq 'lift - 2 freq lept - 2 freq lufit - 1 freq lafayette - 3 freq lobbed - 6 freq luvved - 4 freq levite - 2 freq lïft - 32 freq lapt - 3 freq livid - 4 freq lofty - 2 freq levied - 1 freq luved- - 1 freq left' - 2 freq loupid - 2 freq loopid - 1 freq levit - 2 freq lifit - 2 freq leppid - 1 freq luift - 3 freq loopit - 1 freq livit - 1 freq leftie - 1 freq leivit - 3 freq leift - 1 freq leapit - 2 freq lovit - 2 freq leipit - 1 freq leaped - 2 freq lowp-the- - 1 freq lowpity - 16 freq €œlowpity - 1 freq labout - 1 freq lift't - 1 freq lavy-heid - 1 freq laupit - 1 freq luiffed - 2 freq leftÂ’ - 1 freq lefty - 2 freq livet - 1 freq lobbied - 1 freq lavvyheid - 2 freq lopped - 1 freq |
MetaPhone code - LFT left - 1563 freq luved - 70 freq loved - 186 freq light - 285 freq laughed - 92 freq lived - 145 freq lift - 490 freq leived - 11 freq lft - 2 freq leeft - 11 freq loft - 13 freq leeved - 55 freq luft - 2 freq life'd - 1 freq laft - 26 freq leave't - 2 freq luvit - 1 freq leviet - 1 freq leevit - 4 freq leyft - 1 freq laift - 1 freq lyft - 2 freq 'lift - 2 freq lufit - 1 freq laught - 1 freq laughit - 1 freq luvved - 4 freq levite - 2 freq lïft - 32 freq livid - 4 freq lofty - 2 freq laaght - 1 freq levied - 1 freq luved- - 1 freq left' - 2 freq 'light' - 1 freq levit - 2 freq lifit - 2 freq lyght - 2 freq luift - 3 freq livit - 1 freq leftie - 1 freq leivit - 3 freq leift - 1 freq lovit - 2 freq luiffed - 2 freq left’ - 1 freq lefty - 2 freq livet - 1 freq lightee - 1 freq |
LEEVED |
Time to execute Levenshtein function - 0.199025 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.347164 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.027388 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.036665 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.000844 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. |