| lexicalization | eng: Algorithms on strings |
| subclass of | (noun) a precise rule (or set of rules) specifying how to solve some problem
algorithm, algorithmic program, algorithmic rule |
| has instance | e/Apostolico-Giancarlo algorithm |
| has instance | e/Caverphone |
| has instance | e/Daitch-Mokotoff Soundex |
| has instance | e/Edit distance |
| has instance | e/FM-index |
| has instance | e/Generalised suffix tree |
| has instance | e/Generating strings |
| has instance | e/Jaro-Winkler distance |
| has instance | e/Levenshtein automaton |
| has instance | e/Longest common substring problem |
| has instance | e/Longest increasing subsequence |
| has instance | e/Longest repeated substring problem |
| has instance | e/Match Rating Approach |
| has instance | e/New York State Identification and Intelligence System |
| has instance | e/Partial word |
| has instance | e/Shortest common supersequence |
| has instance | e/String metric |
| has instance | e/String-to-string correction problem |
| has instance | e/Substring index |
| has instance | e/Suffix (computer science) |
| has instance | e/Trim (programming) |
| has instance | e/ru/Z-функция |
| has instance | e/ru/Жадность (регулярные выражения) |
| has instance | e/ru/Префикс-функция |