Compare Text Documents

by Internal Labs

<100

Levenshtein Distance calculates the minimum edits (insertions, deletions, substitutions) to transform one string into another. Used in spell check, fuzzy search; runs in 𝑂 ( 𝑛 × 𝑚 ) O(n×m) time.

by Feat Systems Inc.

1k

Activity which helps in matching words similar to pronunciations

by Office Samurai

<100

This package provides a variety of string comparison methods based on multiple algorithms.

by Amar Srivastava

2.9k

Calculates the more robust Damerau-Levenshtein distance between two strings. Includes an activity for comparing a string against an array of strings to select the closest match.

by Elif Karaoglu

346

This activity finds similarity between two texts and returns similarity percentage.

Compare 2 PDFs and make the differences between them visible with different colors.

by Feat Systems Inc.

298

It compares the data from two or more PDF documents and shows the common data between those PDFs in the form of output part using Write Line Activity.

by Internal Labs

991

Activities that deal with string manipulation (count number of differences between two strings, split, replace, capitalize etc).

by Internal Labs

471

This group of custom activities (String Matching Algorithms) serve the purpose of reducing development time for the user intending to implement one or more string matching logic in their project.

by Internal Labs

11.3k

This activity compares two input DataTables and outputs three new DataTables.

by Adharsh Chandran J S

420

Cosine similarity is a metric used to determine how similar the documents are irrespective of their size

by Patrick Flöß

<100

Calculate the similarity of strings, e.g. Aa / Ab = 50%.

by Internal Labs

<100

Levenshtein Distance calculates the minimum edits (insertions, deletions, substitutions) to transform one string into another. Used in spell check, fuzzy search; runs in 𝑂 ( 𝑛 × 𝑚 ) O(n×m) time.

by Feat Systems Inc.

1k

Activity which helps in matching words similar to pronunciations

by Office Samurai

<100

This package provides a variety of string comparison methods based on multiple algorithms.

by Amar Srivastava

2.9k

Calculates the more robust Damerau-Levenshtein distance between two strings. Includes an activity for comparing a string against an array of strings to select the closest match.