{"ast_node_type":"other","tokens":[{"end":77,"kind":"keyword","start":0,"text":"//!"}]}
//! fuzz-match the query. Or, more formally, given two languages described by
//! lock-step to enumerate the strings which are both in the input set and
//! FSTs, one can build a product FST which describes the intersection of the