ItsHasaN at 14:34, 5 May 2024

2024-05-05T14:34:18Z

← Older revision		Revision as of 14:34, 5 May 2024
Line 42:		Line 42:
	TODO		TODO
	</syntaxhighlight>		</syntaxhighlight>

	<br>		<br>
	Author - HasaN		Author - HasaN

ItsHasaN at 14:32, 5 May 2024

2024-05-05T14:32:23Z

← Older revision		Revision as of 14:32, 5 May 2024
Line 42:		Line 42:
	TODO		TODO
	</syntaxhighlight>		</syntaxhighlight>

	~~Output: 1403/01/26~~

	<br>		<br>

ItsHasaN at 14:32, 5 May 2024

2024-05-05T14:32:01Z

← Older revision		Revision as of 14:32, 5 May 2024
Line 2:		Line 2:
	{{Useful Function}}		{{Useful Function}}
	This function can be used to calculate the Levenshtein distance between two strings		This function can be used to calculate the Levenshtein distance between two strings
			(wiki to Levenshtein distance: https://en.wikipedia.org/wiki/Levenshtein_distance)

	==Syntax==		==Syntax==

ItsHasaN: Created page with "NOTOC {{Useful Function}} This function can be used to calculate the Levenshtein distance between two strings ==Syntax== int levenshtein(string1, string2) ===Required Arguments=== * '''string1''': first string. * '''string2''': second string. ===Returns=== Returns an integer representing the levenshtein distance between this two strings ==Code==
..."

2024-05-05T14:30:59Z

Created page with "__NOTOC__ {{Useful Function}} This function can be used to calculate the Levenshtein distance between two strings ==Syntax== <syntaxhighlight lang="lua">int levenshtein(string1, string2)</syntaxhighlight> ===Required Arguments=== * '''string1''': first string. * '''string2''': second string. ===Returns=== Returns an integer representing the levenshtein distance between this two strings ==Code== <section name="Function source (Server/Client)" class="both" show="true">..."

New page

__NOTOC__
{{Useful Function}}
This function can be used to calculate the Levenshtein distance between two strings

==Syntax==
<syntaxhighlight lang="lua">int levenshtein(string1, string2)</syntaxhighlight>

===Required Arguments===
* '''string1''': first string.
* '''string2''': second string.

===Returns===
Returns an integer representing the levenshtein distance between this two strings

==Code==
<section name="Function source (Server/Client)" class="both" show="true">
<syntaxhighlight lang="lua">
function levenshtein(string1, string2)
local m, n = #string1, #string2
local d = {}
for i = 0, m do
d[i] = {[0] = i}
end
for j = 0, n do
d[0][j] = j
end
for i = 1, m do
for j = 1, n do
local cost = string1:sub(i, i) == string2:sub(j, j) and 0 or 1
d[i][j] = math.min(d[i-1][j] + 1, d[i][j-1] + 1, d[i-1][j-1] + cost)
end
end
return d[m][n]
end
</syntaxhighlight>
</section>

==Example==
The example shows how to use function.
<syntaxhighlight lang="lua">
TODO
</syntaxhighlight>

Output: 1403/01/26

<br>
Author - HasaN
</br>
==See Also==
{{Useful_Functions}}

Levenshtein - Revision history

ItsHasaN at 14:34, 5 May 2024

ItsHasaN at 14:32, 5 May 2024

ItsHasaN at 14:32, 5 May 2024