Skip to main content

LEVENSHTEIN_DISTANCE

Deprecated version

This document refers to a deprecated version of the RQL programming language.

Please go here for documentation related to the latest supported version.

Calculates the Levenshtein distance between two strings. The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

Syntax
LEVENSHTEIN_DISTANCE(<string>, <string>)