- 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
similar_text
Definition
int similar_text ( string $first , string $second [, float &$percent ] )
Description
This calculates the similarity between two strings as described in Oliver [1993]. Note that this implementation does not use a stack as in Oliver's pseudo code, but recursive calls which may or may not speed up the whole process. Note also that the complexity of this algorithm is O(N**3) where N is the length of the longest string.