I have two finite state acceptors, a.fst
and b.fst
. They are both unweighted, simply encoding sequences of words. Their symbol (word) lists have some overlap, but are not identical. Now I want a union of these two fst's.
I think some kind of symbol normalization/mapping should be done before calling fstunion
. But not sure how to do that.