EmbedJoin: Efficient Edit Similarity Joins via Embeddings

We study the problem of edit similarity joins, where given a set of strings and a threshold value K, we want to output all pairs of strings whose edit distances are at most K. Edit similarity join is