Basic and Advance C Question:
Download Job Interview Questions and Answers PDF
I need a sort of an approximate strcmp routine ...
Answer:
I need a sort of an ``approximate'' strcmp routine, for comparing two strings for close, but not necessarily exact, equality.
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.
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.
Download C Programming Interview Questions And Answers
PDF
Previous Question | Next Question |
What is hashing in C? | What is C Programing language? |