Finite state applications with Javascript
Mans Hulden, Miikka Silfverberg, Jerid Francom · DSpace repository (University of Tartu) · 2013
In this paper we present a simple and useful Javascript application programming interface for performing basic online operations with weighted and unweighted finite-state machines, such as word lookup, transductions, and least-cost-path finding.The library, jsfst, provides access to frequently used online functionality in finite-state machine-based language technology.The library is technology-agnostic in that it uses a neutral representation of finite-state machines into which most formats can be converted.We demonstrate the usefulness of the library through addressing a task that is useful in web and mobile environments-a multilingual spell checker application that also detects real-word errors.