Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian filtering that can match mutating phrases as well as single words.
binary | polynomial | Degree of a polynomial | universal binary | Polynomial-time approximation scheme | Monic polynomial | Jones polynomial | Irreducible polynomial | Binary tree | Binary Runtime Environment for Wireless | Binary-coded decimal | XML-binary Optimized Packaging | Polynomial-time reduction | polynomial-time approximation scheme | Polynomial | Lagrange polynomial | (Lagrange) polynomial | HOMFLY(PT) polynomial | HOMFLY polynomial | Donaldson's polynomial invariants | Compound File Binary Format | Binary option | Binary Golay code | Binary file | Binary ethylenimine | Binary compound | binary asteroid |