Ethel edb-c

## psql_fuzzy_search.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                edb-c
                / psql_fuzzy_search.md
            
            
              Created
              January 13, 2022 01:18
                — forked from benoror/psql_fuzzy_search.md
            
              
                Research: PostgreSQL Fuzzy Search 
              
          
    Algorithms

Levenshtein (a.k.a. match difference)


Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other.


https://en.wikipedia.org/wiki/Levenshtein_distance

Soundex (a.k.a. match soundalikes)