Cosine Similarity

作成者: Internal Labs

5.2k

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

作成者: 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.

作成者: Internal Labs

993

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

作成者: Patrick Flöß

<100

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

作成者: Elif Karaoglu

352

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

作成者: Internal Labs

506

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.

作成者: Internal Labs

<100

The Dice Coefficient algorithm/Sørensen-Dice coefficient, is commonly used for comparing the similarity between two strings and provides the matching percentage ranges from 0 to 1.

作成者: Internal Labs

<100

In RPA it improves text similarity matching for deduplication, email classification and data standardization. Customizable thresholds and enhanced efficiency make it ideal for high-volume tasks.

作成者: Novigo Solutions

817

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

作成者: Feat Systems Inc.

1k

Activity which helps in matching words similar to pronunciations

作成者: Office Samurai

<100

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

作成者: Internal Labs

22.3k

The activity accepts two string and returns a similarity percentage in the type System.Single between two strings using Levenshtein Algorithm.

作成者: Internal Labs

5.2k

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

作成者: 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.

作成者: Internal Labs

993

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