Possible to walk the trie?

I don’t see any methods that would allow for just proceeding one edge in the trie, for example:

trie = marisa_trie.Trie([u'key1', u'key2', u'kite'])
trie.edges('k') #would return [u'ke', u'ki']

Using the prefixes method for something like this would be very expensive if the trie is big and the prefix is short. Is there some technical detail I’m missing for why implementing a function for this would be costly, or some other reason this isn’t implemented? It seems like it’s a necessary step in the traversal with the prefixes() method anyway, and quite useful for predictive lookup operations.

[jstypka]

Actually, this is the second time that this feature would be very useful to me, so I thought I might mention it here. I also looked through other Python trie libraries (PyTrie, patricia-trie, python-trie) and neither of them support this.

My usecase (which I would expect to be not that rare) is walking down the tree while computing Levenshtein distance, I use it for fuzzy matches similar to @EliFinkelshteyn.

[EliFinkelshteyn]

Alright, I’ll investigate a bit more, and if it still looks useful, I’ll send over a PR. Closing the issue out here, since it’d be much easier to do for DAWG than the Marisa-Trie.