This paper offers an effective approach to parallel approximate string searching. By using searching state vector and char-pattern matching vector, this approach changes text-pattern matching from comparison to simple integer for operation and by searching string from the two ends to the middle. It implements effectively the parallel approximate Char/Chinese character string searching on multiprocessors. The parallel implementation algorithm and the analysis of the algorithm are also provided.