Levenshtein distance: Difference between revisions
→{{header|jq}}: gojq
(→{{header|jq}}: gojq) |
|||
Line 2,672:
=={{header|jq}}==
{{works with|jq}}
'''Works with gojq, the Go implementation of jq'''
The main point of interest about the following implementation is that it shows how the naive recursive algorithm can be tweaked within a completely functional framework to yield an efficient implementation.
Line 2,746 ⟶ 2,749:
levenshteinDistance between rosettacode and raisethysword is 8
levenshteinDistance between edocattesor and drowsyhtesiar is 8
levenshteinDistance between this_algorithm_is_similar_to and Damerau-Levenshtein_distance is 24
=={{header|Jsish}}==
| |||