Introduction - If you have any usage issues, please Google them yourself
Dictionary tree set S by a number of words (English), given the string K, in the S to find the best match results K. The result of the best matching is defined as the string of the longest common prefix with K.
Cases: S={abc, bdef, Zhen, Zhao, abdd}, K1=zhao, K2=abdf, K3=cheng, and K1 the matching result is Zhao, K2 and the matching result is abdd, K3 and the matching result is epsilon (empty string).