# Comparing Strings

**URL:** <https://forum.knime.com/t/comparing-strings/12939>\
**Category:** KNIME Analytics Platform\
**Created:** [December 17, 2018, 4:56pm UTC](https://forum.knime.com/t/comparing-strings/12939 "2018-12-17T16:56:19Z")\
**Posts on this page:** 1\
**Showing post:** 8

<div class="post-metadata">

**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:** [December 18, 2018, 5:23pm UTC](https://forum.knime.com/t/comparing-strings/12939/8 "2018-12-18T17:23:38Z")

</div>

I built a workflow with two approaches. One using @ScottF example and putting that into a loop, using BitVectors.

And one using the

> **[String Similarity — NodePit](https://nodepit.com/node/ws.palladian.nodes.helper.nlp.StringSimilarityNodeFactory)**
>
> Calculate similarities between strings.

This approach introduces an artificial artificial id (art\_id) and joins every string with every other one and then calculates which string is the closest match.

 ![image](https://forum-cdn.knime.com/uploads/default/original/2X/5/53494d06ed48dc8488ddb950ce0cde29a9504602.png)

 ![image](https://forum-cdn.knime.com/uploads/default/original/2X/7/7d38a0908543631bd02f2b2c1f58df6dcbaf4148.png)

There are several possibilities how to calculate these similarities. You might want to read about them and decide which one is best for your task.

![image](https://forum-cdn.knime.com/uploads/default/original/2X/e/ebc3b29fd6b7dd206b490bcb5e5da8e98aee58da.png)

[kn\_example\_similarity.knar](https://forum-cdn.knime.com/uploads/default/original/2X/b/b6761a930bf9d8dd5cb213dbda53fb30311ff7de.knar) (139.2 KB)

---

_[View the full topic](https://forum.knime.com/t/comparing-strings/12939)._