fsa1 - =$Gc#@#s3#d#Z#d#e#f#d#YZ#d#e#f#d#YZ#d#...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
=$ Gc############@###s3###d##Z##d##e##f##d## ## ##YZ##d##e##f##d## ## ##YZ##d## e##f##d## ## ##YZ##e##h###d###d##<h###d ##d #<h###d###d #<h###d###d #<#d
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
##d#<h##g##d
Background image of page 2
#g## ##Z##e##h###d###d##<h###d ##d #<h###d #d##g###d #<h###d
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
##d#<h##g##d
Background image of page 4
#g## ##Z##e##h###d###d##<h###d ##d #<h###d###d #<h###d ##d##<#d
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
##d#<h##g##d
Background image of page 6
#g## ##Z##d##S(####sW### FSA module This module implements simple deterministic and non-deterministic finite state automata. It follows the description in Chapter 2 of Jurafsky and Martin (2000) fairly closely. @author: Rob Malouf @organization: Dept. of Linguistics, San Diego State University @contact: [email protected] @version: 1 @since: 30-January-2008 t####FSAc############B###sA###e##Z##d##Z##d##d## ##Z##d## ##Z##d## ##Z##d## ##Z# #d##d## ##Z##RS(####s#### General finite-state automaton class An FSA consists of: - an alphabet (C{self.alphabet}) - a state-transition table (C{self.transition_table}) - an initial state (C{self.initial}) - a set of final states (C{self.final}) i####c###########C###sG###|##|##_##x #|##i##D]{#}##xr#|##D]j#}##t##|##| ###d## ##p###|##|###g##|##|##<n###x8#|##|###D],#}##y##|##i##|####WqZ####t##d##| ### ##qZ#XqZ#Wq #Wq##W|##|##_##y##|##i##|##i####Wn#####t##d##|### ##n##Xy2#t##| ## ##|##_##x##|##i##D]##}##|##i##|####q #WWn#####t##d##|### ##n##Xt## ##| ##_##x'#|##i##D]##}##|##i##i##|##i## ## ###q##Wd##S(####s^### Create a new FSA object @param T: the transition function @type T: a C{list} of C{dict}s
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/06/2009 for the course LING 571 taught by Professor Staff during the Fall '08 term at San Diego State.

Page1 / 19

fsa1 - =$Gc#@#s3#d#Z#d#e#f#d#YZ#d#e#f#d#YZ#d#...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online