如何在Python中使用字典树进行文本匹配？

class TrieNode:    def __init__(self):        self.children = {}        self.is_word = Falseclass Trie:    def __init__(self):        self.root = TrieNode()    def insert(self, word):        curr = self.root        for ch in word:            if ch not in curr.children:                curr.children[ch] = TrieNode()            curr = curr.children[ch]        curr.is_word = True    def search(self, word):        curr = self.root        for ch in word:            if ch not in curr.children:                return False            curr = curr.children[ch]        return curr.is_word    def starts_with(self, prefix):        curr = self.root        for ch in prefix:            if ch not in curr.children:                return False            curr = curr.children[ch]        return True

import reword_list = ['hello', 'world', 'python', 'teacher', 'student']def sanitize_word(word):    return re.sub(r'[^a-z]', '', word.lower())def spell_check(word):    trie = Trie()    for w in word_list:        trie.insert(sanitize_word(w))    if trie.search(sanitize_word(word)):        print('Correct spelling!')    else:        print('Did you mean one of the following words?')        similar_words = get_similar_words(trie, sanitize_word(word))        for w in similar_words:            print(w)def get_similar_words(trie, word, distance=1):    similar_words = []    for i in range(len(word)):        for ch in range(ord('a'), ord('z')+1):            new_word = word[:i] + chr(ch) + word[i+1:]            if trie.search(new_word):                similar_words.append(new_word)    return similar_wordsspell_check('helo')