a6e5b969-be6e-4756-ae53-47d3cb899ca4.png

92e985ff-00e5-49c4-a857-2394008c38ac.png

EMEA Delivery Lead

a1276eb2-52fa-4e67-afae-9d2bc740de16.nupkg

Compare Text activity implements [Myer's diff algorithm](https://neil.fraser.name/writing/diff/myers.pdf) which is generally considered to be the best general-purpose diff.

  

**Example:**

  

Input:

  

*   Text1: "Hello World."
*   Text2 "Goodbye World."

  

Output:

*   List&lt;KeyValuePair&gt; of differences is computed which describe the transformation of text1 into text2.
*   The first element specifies if it is an insertion (1), a deletion (-1) or an equality (0). The second element specifies the affected text.
*   Therefore the result for the above Text1 and Text2 is: \[(DELETE, "Hello"), (INSERT, "Goodbye"), (EQUAL, " World.")\]

Compare two blocks of plain text and efficiently return a list of differences.

3abdd972-952b-4dec-98bc-c180eea07cdc.PNG

c4410773-abe4-4425-b3ba-944c2488b5b1.zip

10facc3d-24c6-49b5-9a7f-dae8126e3d87.nupkg

Compare Text activity implements [Myer's diff algorithm](https://neil.fraser.name/writing/diff/myers.pdf) which is generally considered to be the best general-purpose diff.

  

**Example:**

  

Input:

*   Text1: "Hello World."
*   Text2 "Goodbye World."

  

Output:

*   List&lt;KeyValuePair&gt; of differences is computed which describe the transformation of text1 into text2.
*   The first element specifies if it is an insertion (1), a deletion (-1) or an equality (0). The second element specifies the affected text.
*   Therefore the result for the above Text1 and Text2 is: \[(DELETE, "Hello"), (INSERT, "Goodbye"), (EQUAL, " World.")\]

Compare Text Documents