Levenshtein/Universal Automata for approximate string matching using various dictionary backends
An Anti-Rug & Anti-Sandwich Primitive
zip two arrays of comma separated strings