We're going to have to make the graph reversible in order to to query in the opposite direction of the FST. We should probably rename _traverse and whatever the new method is to use the up or down distinction like foma does. To traverse the reversible graph, you're going to want to iterate on the accepting states, and then use each of those accepting states as your starting point in the traversal.
We're going to have to make the graph reversible in order to to query in the opposite direction of the FST. We should probably rename
_traverse
and whatever the new method is to use theup
ordown
distinction likefoma
does. To traverse the reversible graph, you're going to want to iterate on the accepting states, and then use each of those accepting states as your starting point in the traversal.