Relative fuzziness for fast reduction of false positives and false negatives in computational text searches

Abstract

A computer-implemented method for computational textual search to find and display search identified information in documents. Search queries are processed over one or more documents either at a server or user device using match schemes that produce both binary (match or no match) and non-binary (i.e. multiple matching values) results and have relative fuzziness relationships. A fuzzier match scheme implies more results and fewer false negatives and a less fuzzy match scheme implies fewer results and fewer false positives. This fuzziness relationship allows, without changing a search string, for users to quickly change from a match scheme to a fuzzier or less fuzzy match scheme depending on user evaluation of results as containing too many false negatives or too many false positives—without becoming a programmer of complex search string metadata or an expert user of advanced search capabilities.

Dependencies are inferred from the claim text.