About: http://webisa.webdatacommons.org/13706156

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	The Levenshtein Distance algorithm finds 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 Mersenne Twister -
http://www.w3.org/ns/prov#wasQuotedFrom	cliki.net