An input query can be spell checked by first parsing the input query into one or more tokens. The one or more tokens are then compared against spell storage tables to derive alternative tokens. A spell cursor is launched, with the spell cursor calculating scores for permutations of the tokens and alternative tokens, and the scores representing a likelihood that a user intended to use the permutation as the input query. A memory table may then be formed including the permutations and scores. The memory table can then be passed to a column cursor, the column cursor designed to form an output table of results based on queries to a database using the permutations.
展开▼
