Description
The Levenshtein distance (LD) is a metric for measuring the differences between two sequences - or strings. Informally, the LD is the number of individual edits one would have to make to turn one sequence into another.
Technical Details
| Framework | MITRE D3FEND |
| Ontology URI | d3f:LevenshteinMatching |
| Local Identifier | LevenshteinMatching |
| Publication Status | Exists in ontology only |