Sorry your browser is not supported!

a$="my name is John"
b$="John is my name"

len1=len(a$)
len2=len(b$)

a$="-"+a$+"-"
b$="-"+b$+"-"

a$=REPLACE ALL$(a$," ","-")
b$=REPLACE ALL$(b$," ","-")

count1#=STRING COUNT(a$,"-")
count2#=STRING COUNT(b$,"-")

count1#=count1#-1
count2#=count2#-1

if len1<len2 or len1=len2
	ct#=count1#
	div#=count2#
endif

if len2<len1 
	ct#=count2#
	div#=count1#
endif

dim compare$(ct#)

if len1<len2 or len1=len2
	d$=first token$(a$,"-")
endif
if len2<len1 
	d$=first token$(b$,"-")
endif

compare$(1)=d$

for a = 2 to ct#
	d$=next token$("-")
	compare$(a)=d$
next a

count#=0.0

for a=1 to ct#
	if len1<len2 or len1=len2
		sim#=STRING COUNT(b$,compare$(a))
	endif
	if len2<len1
		sim#=STRING COUNT(a$,compare$(a))
	endif
	count#=count#+sim#
next a

print str$((count#/div#)*100) + "% Similar"

wait key

if len1<len2 or len1=len2
	ct#=count1#
	div#=count2#
endif

if len2<len1 
	ct#=count2#
	div#=count1#
endif

if len1<=len2 ` conditions tidied up a bit
	ct#=count1#
	div#=count2#
else ` redundant comparison removed
	ct#=count2#
	div#=count1#
endif

type Cmp_t
   s as string       ` The word
   a as integer      ` Count of this word in a$
   b as integer      ` COunt of this word in b$
endtype

dim Comparison() as Cmp_t

a$="my name is John"
b$="John is my name"

` Split a$ and add it to the Comparison array
split string a$, " "
for i = 1 to split count()
   if split word$(i) <> "" then CheckString( split word$(i), 0 )
next

` Split b$ and add it to the comparison array in the same way
split string b$, " "
for i = 1 to split count()
   if split word$(i) <> "" then CheckString( split word$(i), 1 )
next

` Just for neatness, sort the words alphabetically
sort array Comparison(), 1

` Now just print the results
for i = 0 to array count( Comparison() )
   print padright$( Comparison(i).s, 20 );
   print padleft$( str$(Comparison(i).a), 5 );
   print padleft$( str$(Comparison(i).b), 5 );
   print ""
next

wait key
end


function CheckString(s as string, a_or_b as integer)
   local i as integer

   s = lower$(s)

   ` Search for the string using a simple linear search
   for i = 0 to array count(Comparison())
      if s = Comparison(i).s
         ` Found it, so increment the appropriate counter and exit the function
         inc Comparison(i).a, (a_or_b = 0)      ` if a_or_b is set to zero then this will increment, and the next won't
         inc Comparison(i).b, (a_or_b = 1)      ` if a_or_b is set to one then this will increment, and the previous won't
         exitfunction
      endif
   next i
   
   ` Not found, so add to the bottom
   array insert at bottom Comparison()
   Comparison().s = s
   Comparison().a = (a_or_b = 0)
   Comparison().b = (a_or_b = 1)
endfunction

load dll "String_Similarity.dll",1

//Compares string1 with string2 and returns a percentage of how similar they are.
Simil#=call dll(1,"String_Similarity","string1","string2")
print Simil#

//Returns Longest Common Sequence. In this case "string" is the LCS.

LCS$=call dll(1,"Longest_Common","string1","string2")
print LCS$

//Returns Levenshtein distance: how many characters of the string will need to be changed to be equal.
LD=call dll(1,"String_Distance","string1","string2")
print LD 

wait key : delete dll 1 : end

percent#=Str_Similarity("STRING1","STRING2") : print percent#

lcs$=LCS("STRING1","STRING2") : print lcs$

dist=Str_Distance("STRING1","STRING2") : print dist

wait key : end