Categories:
.NET (357)
C (330)
C++ (183)
CSS (84)
DBA (2)
General (7)
HTML (4)
Java (574)
JavaScript (106)
JSP (66)
Oracle (114)
Perl (46)
Perl (1)
PHP (1)
PL/SQL (1)
RSS (51)
Software QA (13)
SQL Server (1)
Windows (1)
XHTML (173)
Other Resources:
I need a sort of an approximate strcmp routine ...
I need a sort of an approximate strcmp routine ...
✍: Guest
Q: I need a sort of an ``approximate'' strcmp routine, for comparing two strings for close, but not necessarily exact, equality.
A:Some nice information and algorithms having to do with approximate string matching, as well as a useful bibliography, can be found in Sun Wu and Udi Manber's paper ``AGREP--A Fast Approximate Pattern-Matching Tool.''
Another approach involves the ``soundex'' algorithm, which maps similar-sounding words to the same codes. Soundex was designed for discovering similar-sounding names (for telephone directory assistance, as it happens), but it can be pressed into service for processing arbitrary words.
2015-01-09, 1355👍, 0💬
Popular Posts:
What is the difference between Authentication and authorization? This can be a tricky question. Thes...
How you will enable front-end validation based on the xml in validation.xml? The <html:javascr...
What are the five levels in CMMI? There are five levels of the CMM. According to the SEI, Level 1 – ...
What is the difference between Session State and ViewState? ViewState is specific to a page in a ses...
How can I use tables to structure forms Small forms are sometimes placed within a TD element within ...