Technique of finding strings that match a pattern approximately. Examples are the Levenshtein distance, Hamming distance, Edit distance. When using tree data structures, like Trie Data Structure, we need to consider if we want to support fuzzy string matching (original name: Approximate string matching) when implementing the search function.