mirror of
https://github.com/Jermolene/TiddlyWiki5
synced 2024-07-01 17:53:15 +00:00
11ffc83493
* Initial Commit * Fix crash with invalid patches See https://github.com/Jermolene/TiddlyWiki5/pull/7290#issuecomment-1453155311 Thanks @yaisog * Add words and lines options to makepatches (#7326) * Prevent infinite loop for single-word texts (#7327) * Add docs and examples for the new operators (#7328) * Create makepatches Operator.tid * Improve wording * Doc and examples for the new operators --------- Co-authored-by: yaisog <m@rcuswinter.de>
18 lines
750 B
Plaintext
18 lines
750 B
Plaintext
caption: levenshtein
|
|
created: 20230304181639768
|
|
modified: 20230304181642365
|
|
op-purpose: determine the Levenshtein distance of the input title(s) and a given string
|
|
op-input: a [[selection of titles|Title Selection]]
|
|
op-parameter: a string
|
|
op-parameter-name: S
|
|
op-output: the Levenshtein distance between the input title(s) and <<.place S>>
|
|
tags: [[Filter Operators]] [[String Operators]]
|
|
title: levenshtein Operator
|
|
type: text/vnd.tiddlywiki
|
|
|
|
<<.from-version "5.2.6">>
|
|
|
|
The Levenshtein distance is a metric for measuring the difference between two strings. Informally, the Levenshtein distance between two strings is the //minimum// number of single-character edits required to change one string into the other.
|
|
|
|
<<.operator-examples "levenshtein">>
|