def METHOD_NAME(self):
    """
    Test for simple additions using the levensthein function We ensure we
    end up on the right node in the trie when starting from the current
    node
    """
    keyword_proc = KeywordProcessor()
    for keyword in (("colour here", "couleur ici"), ("and heere", "et ici")):
        keyword_proc.add_keyword(*keyword)
    current_dict = keyword_proc.keyword_trie_dict["c"]["o"]["l"]["o"]
    closest_node, cost, depth = next(
        keyword_proc.levensthein("r", max_cost=1, start_node=current_dict),
        ({}, 0, 0),
    )
    self.assertDictEqual(closest_node, current_dict["u"]["r"])
    self.assertEqual(cost, 1)
    self.assertEqual(depth, 2)
    current_dict_continued = {"e": {"e": {"r": {"e": {"_keyword_": "et ici"}}}}}
    closest_node, cost, depth = next(
        keyword_proc.levensthein(
            "ere", max_cost=1, start_node=current_dict_continued
        ),
        ({}, 0, 0),
    )
    self.assertDictEqual(closest_node, current_dict_continued["e"]["e"]["r"]["e"])
    self.assertEqual(cost, 1)
    self.assertEqual(depth, 4)