Jump to content

Information for "Levenshtein distance"

Basic information

Display titleLevenshtein distance
Default sort keyLevenshtein distance
Page length (in bytes)214,980
Namespace ID0
Page ID6587
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page1 (0 redirects; 1 non-redirect)
Page views in the past month41

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creator99.105.56.162 (talk)
Date of page creation03:59, 10 January 2011
Latest editorEschel (talk | contribs)
Date of latest edit15:14, 28 December 2024
Total number of edits433
Recent number of edits (within past 180 days)7
Recent number of distinct authors5

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (13)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e. an edit distance...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.