liveBook · Manning

Finite state transducer

As explained in AI-Powered Search

A finite state transducer is a finite-state machine that maps input sequences to output sequences and can compactly represent and look up many term sequences.

A finite-state transducer (FST) is a compact lookup structure for matching many term sequences quickly. In semantic search, it supports entity extraction from incoming query text when the known-entity list may contain millions of phrases. section 7.4.1

The search pipeline stores surface forms, canonical forms, entity types, spelling variations, and popularity values in an entities collection. Solr can build an FST-backed lookup index from that collection, then tag matching phrases in milliseconds. section 7.4.1

Entity extraction from a query

For “top kimchi near charlotte,” the extractor tags “top,” “near,” and “charlotte.” Popularity can select the location interpretation of “near,” producing a typed query tree containing a popularity function, the keyword “kimchi,” a location-distance function, and Charlotte.

How AI-Powered Search covers it

How deep it goes
Explains compression and lookup purpose but defers the internal mechanics of FST construction and operation.
Examples
Uses an entities collection, Solr text tagger configuration, and the query “top kimchi near charlotte.”
What it assumes
Assumes a known entity list with surface forms, canonical forms, types, spelling variants, and popularity values.
What you can do after
Operate/configure Solr entity extraction with an FST-backed field and interpret tagged query entities.
How it connects
Connects finite-state transducers with entity extraction, semantic search, query parsing, and knowledge graphs.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of AI-Powered Search. The section links point to the parts of the book it draws on.