Hello!
I have read your article "How to match two strings approximately" on http://www.delphiarea.com/articles/how- ... oximately/
So I wonder how could I compare the probability of a string (e.g. 'Path Copy Copy 11.0.2') is contained in 2 strings of approximately 500 characters, where:
• the first 500-char-string (A) contains the string 'PathCopyCopySettings' and
• the second 500-char-string (B) does not contain the string 'PathCopyCopySettings'