NDFST interpreter
(Nondeterministic Finite State Transducer)
Dafydd Gibbon, 2008-08-12
Input:
Switches:
Trace:
off
on
Direction:
forward
reverse
Relation:
off
on
FSA:
# METADATA: UNIGRAM TAGGER # Note that the 'Relation' switch is set to 'on'. # The example demonstrates that a simple unigram tagger is very limited, since # it does not handle potential lexical ambituities. initial = q0 terminal = q0 fst = q0,the,DET,q0; q0,woman,NOUN,q0; q0,greeted,VERB-PAST,q0; q0,man,NOUN,q0; q0,with,PREP,q0; q0,sitting,VERB-PRESPART,q0; q0,at,PREP,q0; q0,a,DET,q0; q0,an,DET,q0; q0,table,NOUN,q0; q0,tall,ADJ,q0; q0,saw,VERB-PAST,q0; q0,saw,VERB-NOUN,q0; q0,red,ADJ,q0; q0,by,PREP,q0; q0,watched,VERB-PAST,q0; q0,orange,ADJ,q0; q0,tie,NOUN,q0; q0,dress,NOUN,q0; q0,this,DET,q0; q0,that,DET,q0; q0,and,CONJ,q0; q0,but,CONJ,q0; q0,of,PREP,q0; q0,when,CONJ,q0; q0,said,VERB-PAST,q0; q0,to,PREP,q0; q0,there,ADV,q0; q0,then,ADV,q0
Go:
Other examples...