Yeah I figured they would have different data and computational penalties. Even some of the scanning ones may be too much, for example one additional rule I left out or this could be a standalone alternative could be similarity to other notes. As the Levenshtein distance created from the notes after removing punctuation, white space, and making all letters uppercase. The distance matrix gives you the uniqueness from measuring against all other notes. Show only the most unique notes from the time window. But I figured that would be too heavy on cpu but perhaps not?