How to understand that different variations of the spelling of the word "Higher Mathematics" have a common ancestor?

Question

Programming

There is a collection that contains thousands of lines with the names of objects, very often the names are repeated. For example, "Higher Mathematics" can be met as "V.Mathematics", "Higher Mathematics", "V.m.", "Higher Mathematics." etc. How to implement an algorithm that assigns different variations with a common ancestor to one collection?

Answer 1

See here