This document provides an abstract for a paper that proposes a new problem called Approximate Membership Localization (AML) for dictionary-based entity recognition. AML aims to locate non-overlapping substrings in a document that approximate true matches, without generating redundant overlapped substrings like Approximate Membership Extraction (AME) does. The paper proposes an algorithm called P-Prune that prunes redundant matched substrings to perform AML more efficiently. Experimental results on real-world datasets demonstrate P-Prune's efficiency over baselines and show that AML outperforms AME, including in a proposed web-based join framework application.