1. A computer-implemented method for performing fuzzy full text search, comprising: receiving a search term; initializing a priority queue by storing a first node and an edit distance of zero in the priority queue, wherein the priority queue comprises entries for each node in an inverted token next valid character tree that track the edit distance between the nodes and the search term; exploring paths of the inverted token next valid character tree from the first node to children nodes of the first node: if there are children nodes, removing the first node from the priority queue by deleting an entry for the first node in the priority queue; storing the children nodes and associated edit distances to the search term in the priority queue, wherein the children nodes are stored in the priority queue in an order of smallest edit distance to largest edit distance; exploring paths of the inverted token next valid character tree from the child node having the smallest edit distance to the search term; 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.