NFST Workbench for English Verbal Sequences
Dafydd Gibbon, U Bielefeld, 2015-12-29
Input:
For the standard demo output, just click SEND
Standardly, the interpreter generates all syllables of length determined by the number of x symbols in the input (max 6).
If
Autoinput
is switched on, all syllables up to the defined length are generated.
Input is in SAMPA IPA notation, following John Wells'
standard definitions for English
. Output is either in SAMPA or in IPA glyphs.
Switches:
Trace:
no
yes
Numbering:
no
yes
SAMPA:
no
yes
Graph:
png
gif
jpg
svg
LR/TB:
LR
TB
Compact:
no
yes
Direction:
forward
reverse
Relation:
no
yes
Autoinput:
no
yes
NFST:
# Filename: english_aux_abstract.html # Data: Dafydd Gibbon # FST: Dafydd Gibbon # Date: 2015-12-29 # Description: Simple Finite State Transducer for English auxiliary verbs # Notes: # - Technical trick: each input item maps to 'x'; this enables sets # of sequences of given lengths to be generated. Thus 'x x' # generates the set of 2-item sequences (max 6 x's) # q1 tense/modal q2 perf q3 prog q4 pass q5 verb q6 initial=q1 terminal=q6 fst= q1,pres+,x,q2; q1,past+,x,q2; q1,can_ ,x,q2; q1,could_ ,x,q2; q1,may_,x,q2; q1,might_,x,q2; q1,must_,x,q2; q1,shall_,x,q2; q1,should_,x,q2; q1,will_,x,q2; q1,would_,x,q2; q2,have_perf+,x,q3; q2,,x,q3; q3,be_prog+,x,q4; q3,,x,q4; q4,be_pass+,x,q5; q4,,x,q5; q5,fight<br>,x,q6