  Given a family of graphs $\mathcal{F}$, we prove that the normalized edit
distance of any given graph $\Gamma$ to being induced $\mathcal{F}$-free is
estimable with a query complexity that depends only on the bounds of the
Frieze--Kannan Regularity Lemma and on a Removal Lemma for $\mathcal{F}$.
