From 37e865cab7cf0469a29156f61417e8ba2c3c0807 Mon Sep 17 00:00:00 2001
From: Harry Stuart <42882697+harrystuart@users.noreply.github.com>
Date: Wed, 7 Dec 2022 21:03:20 +1100
Subject: [PATCH] Update README.md

---
 README.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/README.md b/README.md
index 158b93c..f5d4ef6 100644
--- a/README.md
+++ b/README.md
@@ -3,6 +3,8 @@ NormNumSuM (Normalised Number of Substring Movements) is a string comparison alg
 
 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.
 
+Below are some example results (lower is better.)
+
 
 ```
 normnumsum("richmond tigers vs sydney swans", "sydney swans vs richmond tigers")