Would they both be considered string matching algorithms?
Say I want to detect how close two strings are, so I want to match them. Thus I would use the Levenshtein Word Distance. However, if the strings are entire sentences, maybe first i should use the search algorithm or is it an overkill? Do these two algorithms complement each other? It seems to me there is some overlap in the use between them, but i cannot explain what it might be. Therefore i am asking what is the relation between the two if any?
Yes, this is pretty much a noob question.