Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's BlogIt turns out that finite state machines are useful for things other than expressing computation. Finite state machines can also be used to compactly represent ordered sets or maps of strings that can be searched very quickly. In this article, I will teach you about finite state machines as a data structure for representing ordered sets and maps. This includes introducing an implementation written
[MAHOUT-1252] Add support for Finite State Transducers (FST) as a DictionaryType. - ASF JIRA
