How to perform FST (Finite State Transducer) composition

Posted by Tasbeer on Stack Overflow See other posts from Stack Overflow or by Tasbeer
Published on 2010-04-15T22:40:27Z Indexed on 2010/04/15 22:43 UTC
Read the original article Hit count: 384

Consider the following FSTs :

T1 

0 1 a : b
0 2 b : b
2 3 b : b
0 0 a : a
1 3 b : a

T2

0 1 b : a
1 2 b : a
1 1 a : d
1 2 a : c

How do I perform the composition operation on these two FSTs (i.e. T1 o T2) I saw some algorithms but couldn't understand much. If anyone could explain it in a easy way it would be a major help.

Please note that this is NOT a homework. The example is taken from the lecture slides where the solution is given but I couldn't figure out how to get to it.

© Stack Overflow or respective owner

Related posts about natural-language

Related posts about natural-language-process