Abstract: This paper proposes an efficient approach to computing edit distances and edit paths for both char （one byte） strings and Chinese character （two bytes） strings, which, at first, computes edit distances by using an efficient string approximate matching algorithm, and then computes correctly （the shortest） edit paths by using only simple binary bit operations. The whole implementation algorithm and the complexity analysis of the algorithm are also provided.