Text Similarity

by Novigo Solutions

813

This is an UiPath Custom Activitiy built using String Similarity .NET, a library implementing different string similarity and distance measures

by Debakanta Mahanta

<100

This activity can be used to create an image from a given text as string.

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 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 Patrick Flöß

<100

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

by Internal Labs

470

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 Feat Systems Inc.

1k

Activity which helps in matching words similar to pronunciations

by Adharsh Chandran J S

420

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

by Internal Labs

991

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

by Office Samurai

<100

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

by Internal Labs

5.2k

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

by UiPath

<100

This model compares a single reference sentence with a bunch of other candidate sentences and ranks these sentences in order of similarity.

by Novigo Solutions

813

This is an UiPath Custom Activitiy built using String Similarity .NET, a library implementing different string similarity and distance measures

by Debakanta Mahanta

<100

This activity can be used to create an image from a given text as string.

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 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.