- A
- addcslashes
- addslashes
- B
- bin2hex
- C
- chr
- chunk_split
- convert_cyr_string
- convert_uudecode
- convert_uuencode
- count_chars
- E
- explode
- G
- get_html_translation_table
- H
- hebrev
- hebrevc
- html_entity_decode
- htmlentities
- htmlspecialchars
- htmlspecialchars_decode
- I
- implode
- L
- lcfirst
- levenshtein
- ltrim
- M
- metaphone
- money_format
- N
- nl2br
- nl_langinfo
- number_format
- O
- ord
- P
- parse_str
- Q
- quoted_printable_decode
- quoted_printable_encode
- quotemeta
- R
- rtrim
- S
- similar_text
- soundex
- sprintf
- str_getcsv
- str_ireplace
- str_pad
- str_repeat
- str_replace
- str_rot13
- str_shuffle
- str_split
- str_word_count
- strcasecmp
- strcmp
- strcoll
- strcspn
- strip_tags
- stripcslashes
- stripos
- stripslashes
- stristr
- strlen
- strnatcasecmp
- strnatcmp
- strncasecmp
- strncmp
- strpbrk
- strpos
- strrchr
- strrev
- strripos
- strrpos
- strspn
- strstr
- strtok
- strtolower
- strtoupper
- strtr
- substr
- substr_compare
- substr_count
- substr_replace
- T
- trim
- U
- ucfirst
- ucwords
- V
- vsprintf
- W
- wordwrap
levenshtein
Definition
int levenshtein ( string $str1 , string $str2 )
Description
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform str1 into str2. The complexity of the algorithm is O(m*n), where n and m are the length of str1 and str2 (rather good when compared to similar_text(), which is O(max(n,m)**3), but still expensive).