14. A fuzzy full text search system, comprising: a processor; and memory storing an index organized as an inverted token next valid character tree, a priority queue, and query processing executable by the processor to perform a fuzzy full text search using a ranked nearest neighbor query, wherein the processor is configured to provide results to the ranked nearest neighbor query, the results including a first result set for a first edit distance to search terms and a second result set for a second edit distance to search terms, and wherein the priority queue comprises entries for each node in the inverted token next valid character tree that tracks an overall edit distance of currently explored nodes in the inverted token next valid character tree and multiple search tokens, wherein the explored nodes are stored in the priority queue in an order of smallest edit distance to largest edit distance, wherein the processor is configured to explore paths of the inverted token next valid character tree from a child node having the smallest edit distance to one of the multiple search tokens; and in response to the path from the child node ending at a leaf node, providing a result set of document identifiers stored at the leaf node.
15. The system of claim 14 , wherein the priority queue tracks current position of the query processing.