| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| atomheart (0) - 1 freq stothart (3) - 1 freq athwart (3) - 6 freq compaart (4) - 1 freq atourt (4) - 1 freq athourt (4) - 5 freq tamhere (4) - 1 freq anocher (4) - 1 freq soothwart (4) - 2 freq atotheod (4) - 2 freq compeert (4) - 1 freq compear (4) - 4 freq heart (4) - 184 freq timmert (4) - 1 freq tethert (4) - 3 freq hameart (4) - 3 freq atomie (4) - 3 freq comeat (4) - 1 freq tother (4) - 1 freq topher (4) - 1 freq atower (4) - 1 freq atmoshere (4) - 1 freq €˜compeart (4) - 1 freq atheist (4) - 2 freq tocher (4) - 25 freq |
atomheart (0) - 1 freq tempert (5) - 2 freq tethert (5) - 3 freq athort (5) - 122 freq tamhere (5) - 1 freq timmert (5) - 1 freq stothart (5) - 1 freq athwart (5) - 6 freq athourt (5) - 5 freq €˜heart (6) - 1 freq thwart (6) - 1 freq towert (6) - 1 freq temerat (6) - 1 freq towart (6) - 54 freq thrait (6) - 3 freq temperit (6) - 1 freq thourt (6) - 1 freq atwart (6) - 6 freq tortert (6) - 1 freq ather (6) - 3 freq poothert (6) - 1 freq foothert (6) - 2 freq stachert (6) - 4 freq gathert (6) - 3 freq bothert (6) - 37 freq |
SoundEx code - A356 admirin - 22 freq admiration - 14 freq admirer - 4 freq admire - 32 freq 'admire' - 1 freq admirers - 4 freq admiralty - 4 freq admired - 15 freq admiral - 3 freq admirals - 2 freq athenor - 1 freq admeir - 2 freq admieraetion - 1 freq admiran - 2 freq athenry - 2 freq admir - 1 freq admeirin - 1 freq admiring - 2 freq adamrooney - 1 freq aidanreilly - 16 freq adamrutherford - 1 freq adamramsay - 2 freq adamrmcvey - 1 freq awtmry - 1 freq atomheart - 1 freq |
MetaPhone code - ATMHRT atomheart - 1 freq |
ATOMHEART |
| Time to execute Levenshtein function - 0.228696 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.351488 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.028065 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.037361 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.000933 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. |