.\" Automatically generated by Pod::Man 4.10 (Pod::Simple 3.35) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is >0, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .\" .\" Avoid warning from groff about undefined register 'F'. .de IX .. .nr rF 0 .if \n(.g .if rF .nr rF 1 .if (\n(rF:(\n(.g==0)) \{\ . if \nF \{\ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{\ . nr % 0 . nr F 2 . \} . \} .\} .rr rF .\" ======================================================================== .\" .IX Title "LevenshteinXS 3pm" .TH LevenshteinXS 3pm "2018-11-01" "perl v5.28.0" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" Text::LevenshteinXS \- An XS implementation of the Levenshtein edit distance .SH "SYNOPSIS" .IX Header "SYNOPSIS" .Vb 1 \& use Text::LevenshteinXS qw(distance); \& \& print distance("foo","four"); \& # prints "2" \& \& print distance("foo","bar"); \& # prints "3" .Ve .SH "DESCRIPTION" .IX Header "DESCRIPTION" This module implements the Levenshtein edit distance in a \s-1XS\s0 way. .PP The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions (\*(L"edits\*(R") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. A good point to start is: .SH "CREDITS" .IX Header "CREDITS" All the credits go to Vladimir Levenshtein the author of the algorithm and to Lorenzo Seidenari who made the C implementation .SH "SEE ALSO" .IX Header "SEE ALSO" Text::Levenshtein , Text::WagnerFischer , Text::Brew , String::Approx .SH "AUTHOR" .IX Header "AUTHOR" Copyright 2003 Dree Mistrut <\fIdree@friul.it\fR> Modifications Copyright 2004 Josh Goldberg <\fIjosh@3io.com\fR> .PP This package is free software and is provided \*(L"as is\*(R" without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself.