In the previous posts I wrote about the finite-state automata (FSA). Now we’ll cover finite-state transducers (FST), which allow to index text with values in libraries such as elasticsearch.
In this post we’ll take closer look at the Python implementation of algorithm for constructing finite-state automata from unsorted set of words.
Have you ever wondered how Lucene/Elasticsearch does its job so well? This post will teach you about essential part of the Lucene index - minimal finite-state automaton (FSA).