Harry/NormNumSum
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Harry Stuart 2022-12-07 21:02:02 +11:00 committed by GitHub
parent ca8ee31caf
commit 260e74ddd2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -1,5 +1,5 @@
# NormNumSuM
NormNumSuM (Normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant. The algorithm works by iteratively finding the longest substring between the two strings, removing the previously found substring at each timestep and finally comparing this value to the length of the shortest string.
NormNumSuM (Normalised Number of Substring Movements) is a string comparison algorithm designed to be token-order invariant. The algorithm works by iteratively finding the longest substring between the two strings, removing the previously found substring at each timestep and finally comparing this value to the length of the shortest string.
Most existing string comparison algorithms, such as Levenshtein Distance, assert that the two strings should be "similar from left to right". These common algorithms are unsuitable for situations where one is looking to compare string similarity at the token level, where the order of tokens is less important. Rather than naively comparing tokens (where misspellings can be detrimental if token comparison is binary), the proposed substring approach allows for a more continous measure of similarity between strings at the token level. This is also a very lightweight approach relative to mechanisms employing semantic analysis.