Patent ID: 9081821
Filing Date: 2015-07-14
Classification: G06F

Abstract:
1. A system comprising: a query parser configured to parse an input query into one or more tokens; a document searcher configured to compare the one or more tokens against spell storage tables to derive alternative tokens, and to launch a spell cursor in response to a determination that no matches are found in the spell storage tables for the one or more tokens; the spell cursor configured to calculate scores for permutations of the tokens and alternative tokens, the scores representing a likelihood to use the permutation as the input query, the spell cursor calculates the scores by accessing a directed acyclic word graph (DAWG) containing alternative tokens indexed by n-grams of continuous sequences of alternative tokens; and the spell cursor further configured to generate a memory table including the permutations of the tokens and alternative tokens and the calculated scores, and to pass the memory table to a column cursor, the column cursor designed to generate an output table of results based on queries to a database using the permutations.