1. A computer-implemented method for performing fuzzy full text search, comprising: receiving a search term; exploring paths of an inverted token next valid character tree from a root node to children nodes of the root node; storing the children nodes and associated edit distances to the search term in a priority queue; exploring paths of the inverted token next valid character tree from the child node having the smallest edit distance to the search term; and if the path from the child node ends at a leaf node, providing a result set of document identifiers stored at the leaf node.