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 18:10:38 +11:00 committed by GitHub
parent a3fa2828d9
commit 2bb7cf5fc5
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,2 +1,2 @@
# NormNumSuM # NormNumSuM
NormNumSuM (Normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant. 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.