spell checking - What is the best way to implement a FSA/FSM in Java -
i have big finite state automaton 50 states , each state has avg. 3-4 transitions other states. don't think "state pattern" suitable this. fsm tends spellchecker , morphological analyzer agglutinative language.
what best way implement fsa/fsm in java or should use open source library. since natural languages not regular (have exception cases), there way make implementation flexible such situations.
thanks
it seems straightforward implement directed, labelled graph. perhaps there graph libraries java appropriate too, have no experience them leave others make specific recommendations.
Comments
Post a Comment