GitHub - pem/string-metrics: C library for computing string metrics like Levenshtein Distance and Longest Common Substring

pem / string-metrics Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

C library for computing string metrics like Levenshtein Distance and Longest Common Substring

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
.gitignore		.gitignore
LICENSE.txt		LICENSE.txt
Makefile		Makefile
README.txt		README.txt
edit-distance.c		edit-distance.c
lcsubstr.c		lcsubstr.c
sm-utf8.c		sm-utf8.c
sm-utf8.h		sm-utf8.h
smtest.c		smtest.c
string-metrics.h		string-metrics.h

Repository files navigation

C functions for calculating some string metrics:
- Levenshtein Distance
- Optimal String Alignment Distance or Restricted Edit Distance
  This is like Levenshtein Distance plus transposition.
- Damerau-Levenshtein Distance
- Longest common substring

There are two variants of the functions:
- Without the "_wchar" suffix, takes "char *" strings as parameters.
  These assumes 8-bit encodings, i.e. USASCII or ISO8859/Latin encodings.
  They do not work with UTF-8 strings.
- With the "_wchar" suffix, takes "wchar_t *" strings. Convert UTF-8 strings
  to wchar_t to use these.

References:
https://en.wikipedia.org/wiki/String_metric
https://en.wikipedia.org/wiki/Levenshtein_distance
https://en.wikipedia.org/wiki/Damerau-Levenshtein_distance
https://en.wikipedia.org/wiki/Wagner-Fischer_algorithm
https://en.wikipedia.org/wiki/Longest_common_substring_problem