I try to develop a string compare with tiny substrings to have a value for similarity.
That is not a problem if you use loops. But I wanted to do so with (recursive) RegEx.
An example:
If I have the two Names 'Indiana Jones' and 'John Dow'. I then want to count these substring which are identically.
next you cut each name in two letter substrings like 'In', 'nd', 'di', 'ia', 'an', 'na', 'Jo', 'on', 'ne', 'es' and 'Jo', 'oh', 'hn', 'Do', 'ow'. Now I want do count the identical substrings out of MAX(COUNT(substrings_name1),COUNT(substrings_name1)). So I have a value for comparison.
Does anybody have an idea how the RegEx have to look like.
Many thanks in advance.
Steffen