Go to file
2022-12-07 18:10:38 +11:00
normnumsum.py Create normnumsum.py 2022-12-07 18:09:43 +11:00
README.md Update README.md 2022-12-07 18:10:38 +11:00

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.