| http://www.w3.org/ns/prov#value | - According to wikipedia, The Levenshtein distance between two strings is given by the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character. ;this might work.
|
