Assertion: levenshtein distance | /r/HasProperty | equal
Facets:
value: to the minimum number of operations
type: OTHER
Source sentences:
text: In Levenshtein's original definition, each of these operations has unit cost (except that substitution of a character by itself has zero cost), so the Levenshtein distance is equal to the minimum number of operations required to transform a to