 Computing the "E"("x", "y") array takes "O"("mn") time with the dynamic programming algorithm, while the backwards-working phase takes "O"("n" + "m") time.Another recent idea is the similarity join.When matching database relates to a large scale of data, the "O"("mn") time with the dynamic programming algorithm cannot work within a limited time.