String function Library: Levenshtein

Source: Internet
Author: User
Keywords levenshtein php Chinese Function Handbook
Tags aliyun function function library html http php php chinese function handbook php3

Levenshtein

(PHP3 CVS only, PHP4 >= 4.0.1)

Levenshtein---&http://www.aliyun.com/zixun/aggregation/37954.html ">nbsp; Computes the levenshtein-distance between two strings

Syntax: int Levenshtein (String str1, String str2)

Description:

This function returns the levenshtein-distance between two parameters, and returns 1 if the length of the argument exceeds the limit of 255 characters.

Levenshtein-distance is defined as the smallest number of characters you have to replace, insert, or delete to change str1 to become str2. The complexity of the algorithm is 0 (m*n), n is the length of the parameter str1, and M is the length of the parameter str2.

Reference: Soundex () Similar_text () Metaphone ()

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.