OSC — Lucene 4 Finite State Automata in 10 minutes (Intro & Tutorial)
Lucene’s Automaton API provides a way to create and use Finite State Automata(FSAs). For those who don’t remember their senior level computer science, FSA is a computational model whereby input symbols are read by the computer — the automaton — to drive a state machine. The state machine is simply a graph with nodes and labeled, directed edges. Each node in the graph is a state, and each edge is a transition labeled with a potential input symbol. By matching the current node’s edges to the current input symbol, the automaton follows edges to the next state. The next input symbol is read, and based on the transitions of the new state, we transition to yet another state, so-on and so-forth.
Read full article from OSC — Lucene 4 Finite State Automata in 10 minutes (Intro & Tutorial)
No comments:
Post a Comment