OpenFst Library for constructing weighted finite-state transducer

  •        581

OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. FSTs have key applications in speech recognition and synthesis, machine translation, optical character recognition, pattern matching, string processing, machine learning, information extraction and retrieval among others.

http://www.openfst.org/twiki/bin/view/FST/WebHome

Tags
Implementation
License
Platform

   




Related Projects

fst - Represents large sets and maps compactly with finite state transducers.


This crate provides a fast implementation of ordered sets and maps using finite state machines. In particular, it makes use of finite state transducers to map keys to values as the machine is executed. Using finite state machines as data structures enables us to store keys in a compact format that is also easily searchable. For example, this crate leverages memory maps to make range queries very fast.Check out my blog post Index 1,600,000,000 Keys with Automata and Rust for extensive background, examples and experiments.

openfst - OpenFst - library for finite state transducers development


OpenFst - library for finite state transducers development

openfst-utils - Utilities for manipulating finite state transducers with the OpenFst library.


Utilities for manipulating finite state transducers with the OpenFst library.

scalanlp-fst - (Weighted) Finite State Transducers for Scala NLP


(Weighted) Finite State Transducers for Scala NLP



Java Automata Library


A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.

finite-state-automata - A pure and generic implementation of finite state automata in Haskell.


A pure and generic implementation of finite state automata in Haskell.

fstpop - population model of finite state transducers


population model of finite state transducers

foma


Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers.

vellum - A Go library implementing an FST (finite state transducer)


To build an FST, create a new builder using the New() method. This method takes an io.Writer as an argument. As the FST is being built, data will be streamed to the writer as soon as possible. With this builder you MUST insert keys in lexicographic order. Inserting keys out of order will result in an error. After inserting the last key into the builder, you MUST call Close() on the builder. This will flush all remaining data to the underlying writer.After closing the builder, the data can be used to instantiate an FST. If the data was written to disk, you can use the Open() method to mmap the file. If the data is already in memory, or you wish to load/mmap the data yourself, you can instantiate the FST with the Load() method.

FSM - Implementation of a simple finite state automata.


Implementation of a simple finite state automata.

PyFSA - Python Libraries and Samples of Finite State Automata


Python Libraries and Samples of Finite State Automata

djinn - Javascript Finite State Automata


Javascript Finite State Automata

tNFA - Tagged non-deterministic finite-state automata


Tagged non-deterministic finite-state automata

mafsa - Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of strings


Package mafsa implements Minimal Acyclic Finite State Automata (MA-FSA) with Minimal Perfect Hashing (MPH). Basically, it's a set of strings that lets you test for membership, do spelling correction (fuzzy matching) and autocomplete, but with higher memory efficiency than a regular trie. With MPH, you can associate each entry in the tree with data from your own application.A BuildTree is used to build data from scratch. Once all the elements have been inserted, the BuildTree can be serialized into a byte slice or written to a file directly. It can then be decoded into a MinTree, which uses significantly less memory. MinTrees are read-only, but this greatly improves space efficiency.

fst - an implement of finite-state transducer


an implement of finite-state transducer

transduce - map-state, mapcat-state, etc for state transducers in Clojure


map-state, mapcat-state, etc for state transducers in Clojure

StatefulJ - Event Driven Finite State Machine (FSM)


StatefulJ is a lightweight, open source Java Event Driven Finite State Machine(FSM) and a complete Spring Data based framework which lets you easily define and integrate State Machines into your Applications. It is simple, dependency free, in memory implementation of an FSM with support for concurrency and non-deterministic transitions.

Finite State Machine Editor


A Finite State Machine Editor, written on QT. It allows to draw Finite State Machine with easy GUI and store it in XML file. There are Finite State Machine Compilers to translate this description to source code (technique like QT's UIC uses).