| Home | Trees | Indices | Help |
|---|
|
|
A class version of the deterministic FSA recognizer.
Two variants are included in this module an ordinary deterministic recognizer class, and a class for deterministic recognizers that asume fsa's with sink state. The latter class adds a sink state to its fsa, if necessary.
|
|||
|
det_fsa_recognizer Class for deterministic fsa recognizers. |
|||
|
det_fsa_recognizer_with_sink_state Deterministic fsa recognizer which adds a sink state to its fsa upon initializiation, if necessary, and has a slightly simplified recognition algorithm as a result. |
|||
|
|||
| TransitionTable |
transitions = the Transition Table (list of state transition functions) transitions for machine fsa1 |
||
| tuple |
finals = the tuple of finals for machine fsa1 |
||
| fsa |
fsa1 = {fan FSA machine for sheep language (Jurafsky and Martin, Speech and Natural Language Processing, Fig 2.12) |
||
| det_fsa_recognizer |
R1 = [det_fsa_recognizA deterministic fsa recognizer using fsa1 |
||
| det_fsa_recognizer_with_sink_state |
R2 = [det_fsa_recognizer_with_sink_staA deterministic fsa recognizer with a sink state using fsa1 |
||
|
|||
transitionsthe Transition Table (list of state transition functions) transitions for machine fsa1
|
fsa1an FSA machine for sheep language (Jurafsky and Martin, Speech and Natural Language Processing, Fig 2.12)
|
R1A deterministic fsa recognizer using fsa1
|
R2A deterministic fsa recognizer with a sink state using fsa1
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Wed Feb 4 22:00:33 2009 | http://epydoc.sourceforge.net |