Bixby Developer Center

Specifies the algorithm used to calculate the similarity between the two strings.

• Edit: Measures the difference between two strings in terms of single character edits. More specifically, this uses the Damerau-Levenshtein algorithm to calculate the minimum number of single character edit operations (insertions, deletions, substitutions, and transpositions) required to change one string into the other. This is the default.
• Token: Calculates the difference between two strings in terms of whole word insertions, deletions, and permutations. This uses the Cosine Similarity algorithm.
• EditToken: This is a hybrid of the Edit and Token algorithms, which calculates the difference between two strings taking into account both the character level edits and the word level edits required to change one string into the other. This uses the Monge-Elkan algorithm.