Back to: FsmReg
FsmRegForm
AbbrName fsm2
FullName Potsdam FST Library
ItemDesc An open source toolkit that covers several semirings and nearly all routines of the AT&T thing. As always, it is growing and incomplete in some respect. It can be compiled with MSVC++ 7/8 and g++ 4. It has a regular expression syntax based on a bison grammar. You can find it here: http://www.ling.uni-potsdam.de/~tom/fsm/

APartOf

ContainsParts

HomePage http://www.ling.uni-potsdam.de/~tom/fsm/
Type FsmCompiler
ImplLanguage

Author

Copyright

License

References On a longest replace in PFST, see Hanneforth (2005).
Availability

ProviderName

RelatedWork Bryan Jurish started gFSM as a subset of PFSM toolkit, since PFSM
toolkit wasn't free at that time (now it is).
Evaluation

LatestVersion

Topic revision: r2 - 2008-10-23 - AnssiYliJyra
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback