Non-Deterministic Finite State Transducer (NDFST)
TEST NDFST, 2012-09-05)
Input:
Two possible English strings:
this is hard
,
that was easy
.
Input:
Switches:
Trace:
off
on
Decoration:
off
on
Autoinput:
off
on
Graph:
off
on
LR/TB:
LR
TB
Compact:
no
yes
Direction:
forward
reverse
Relation:
off
on
Operations:
FST:
# test-ndfst.html # TEST NDFST # Non-deterministic FST # D. Gibbon 2012-09-05 initial=state01 terminal=state05 fst= state01,this,dies,state02; state01,this,dieses,state02; state01,that,das,state02; state01,it,es,state02; state02,is,ist,state03; state02,was,war,state03; state02,is,ist,state04; state02,was,war,state04; state03,rather,ziemlich,state04; state03,very,sehr,state04; state04,hard,schwierig,state05; state04,hard,hart,state05; state04,cool,grossartig,state05; state04,cool,geil,state05; state05,and,und,state03; state05,but,aber,state03; state05,and,und,state04; state05,but,aber,state04