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.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
CODE The Hidden Language of Computer Hardware and Software | |
https://bobcarp.files.wordpress.com/2014/07/code-charles-petzold.pdf | |
The C Programming Language by Brian Kernighan and Dennis Ritchie | |
http://cslabcms.nju.edu.cn/problem_solving/images/c/cc/The_C_Programming_Language_%282nd_Edition_Ritchie_Kernighan%29.pdf |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Collection of Postgres Notes | |
https://doxygen.postgresql.org/index.html | |
https://explain.depesz.com/help |
I hereby claim:
- I am edb-c on github.
- I am ecofresi (https://keybase.io/ecofresi) on keybase.
- I have a public key whose fingerprint is 2BDB 0459 F2E7 A6C3 23D2 353B 0E1C 4485 5CA1 7F4D
To claim this, I am signing this object: