We are given a text $T$ of length $n$ over alphabet $\Sigma$, and a dictionary $D$ of $d$ gapped patterns $P_1, \dots, P_d$ over alphabet $\Sigma$ where each pattern has at most one gap. We wish to output all locations in $T$ where a pattern $P_i\in D$, $1\leq i\leq d$, ends. (A gapped pattern $P$ is one of the form $P^1 \{\alpha, \beta\} P^2$ where each subpattern $P^1$, $P^2$ is a string over alphabet $\Sigma$, and $\{\alpha, \beta\}$ matches any substring of length at least $\alpha$ and at most $\beta$.)