deeppavlov/models/spelling_correction/levenshtein/tabled_trie.py
def _descend_simple(self, curr, s):
        """
        Спуск из вершины curr по строке s
        """
        for a in s:
            curr = self.graph[curr][self.alphabet_codes[a]]
            if curr == Trie.NO_NODE:
                break
        return curr
def _descend_simple(self, curr, s):
        """
        Спуск из вершины curr по строке s
        """
        for a in s:
            curr = self.graph[curr][self.alphabet_codes[a]]
            if curr == Trie.NO_NODE:
                break
        return curr
def _descend_simple ( self , curr , s ) : for a in s : curr = self . graph [ curr ] [ self . alphabet_codes [ a ] ] if curr == Trie . NO_NODE : break return curr
Спуск из вершины curr по строке s
Спуск из вершины curr по строке s