! 2 minutes implementation of 
! http://www.devarticles.com/c/a/Development-Cycles/How-to-Strike-a-Match/1/
! algorithm by Simon White


USING: grouping kernel math sequences sets unicode.case ;

: similarity ( string string -- n )
    [ >upper 2 clump ] bi@ [ intersect length 2 * ] 2keep
    [ length ] bi@ + / ;

! umm, btw, if I haven't mentioned it before, you can use any code that I paste here.