# Flag similar rows **URL:** \ **Category:** KNIME Analytics Platform\ **Created:** [July 19, 2022, 2:59pm UTC](https://forum.knime.com/t/flag-similar-rows/45250 "2022-07-19T14:59:47Z")\ **Posts on this page:** 1\ **Showing post:** 12
**Author:** ![mlauber71](https://forum-cdn.knime.com/user_avatar/forum.knime.com/mlauber71/32/73590_2.png) [@mlauber71](https://forum.knime.com/u/mlauber71)\ **Post date:** [July 20, 2022, 8:49pm UTC](https://forum.knime.com/t/flag-similar-rows/45250/12 "2022-07-20T20:49:27Z")
@JWebb here is an approach how to group addresses that are similar. Some additional aspects are being discussed > [@How can I define and list the duplication in an adress data set sucessfully, with using String Distances node and Similarity Search node?](https://forum.knime.com/t/how-can-i-define-and-list-the-duplication-in-an-adress-data-set-sucessfully-with-using-string-distances-node-and-similarity-search-node/42568/12): > > @DAmei I had another look and I built a slightly over engineered workflow to try and get what you want combining some of the approached already mentioned. In your case there might not be a ground truth against wich to match but rather a lot of possible combinations. So configuration will be necessary and maybe exclude some obvious detaches in the first place. What the workflow does: the address is turned into a standardised string. The composition of the string will influence the matching. So… > **[address deduplication, string similarity and fingerprinting (a collection) –...](https://hub.knime.com/mlauber71/spaces/Public/_adress_dedupe_string_similarity~MpPcaokcf9j8TF0j/current-state)** > > address deduplication, string similarity and fingerprinting (a collection) A few links and ressources I collected about address deduplication and string simila… > [@Getting Started With ML](https://forum.knime.com/t/getting-started-with-ml/26531/3): > > Another approach here might be to use the [Similarity Search](https://kni.me/n/LAcCo6A4MFNixQyw) node with Levenshtein distance - you feed the misspellings to the top port and your dictionary to the middle port, and let the node find the best match. I just made a simple workflow (based on an exercise from our L1-DW course) that uses your data: --- _[View the full topic](https://forum.knime.com/t/flag-similar-rows/45250)._