This paper shows a simple, efficient, and practical algorithm for locating all occurrences of a finite number of a finite number of keywords in a char/Chinesw character string allowing k chars inserting errors.The algorithm consists of constructing muleiple finite state single-pattern matching machines form keywords and a state-driver appled to drive all finite state finite state single-pattern matching machines,and then using the state-driver to process the text string in a single pass.Speed of the matching is independentof the amount of the inserting errors.Generally,the text string in a not need to inspect every character of the string.They skip as many characters as possible by making full use of the information in matching failure and text window mechanism.This algorithm can be widely applied to network infomation auditing,database,information retrieval,and etc.