In this talk we consider the reliability of the matching process in a database search problem where the search query is noisy. Information theoretic architectures for this problem have been studied. We focus on developing error exponent results for the matching process, discuss extensions and open problems.