Unlock the full potential of your automation projects today and revolutionize the way you handle string manipulation tasks.

String Manipulation

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

cad5e2ef-d8ee-4363-bb56-37d46f2480d1.jpg

Solution Architect

254f690c-3a78-407f-aefa-07e9a9bfe398.nupkg

d33735ca-1080-451e-8057-0cc09815058e.png

This custom activity is composed of 7 string matching algorithms and 1 helper tool activity (string clean-up).

  

The following activities are included in the package:

· Damerau Levenshtein

· Dice Coefficient

· Hamming Distance

· Jaccard Similarity

· Jaro Distance

· Jaro Winkler

· Levenshtein

· String Clean-up (helper activity tool)

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

c838bf46-d54c-44cd-a08b-f5310db1ad29.png

b85f8f45-e658-48c0-a84c-de345d0331a2.png

0779ee3e-a568-4242-bc39-af7f793026fd.png

2193e41a-ab15-4fc4-8a5d-b9651b04d40b.png

95589f01-5ceb-42d2-bad2-f249d362a9f1.png

Visual Basic

54d7ba3f-15cf-49e7-a8c6-907863a64c2e.docx

f60189db-44c5-43d0-b8b8-0c0a75af80bd.zip

c61eb438-591f-4e68-bdf4-c5a28beb53b9.nupkg

fdcaa75c-2bc6-401c-9cc2-4df08d9c6c0d.zip

e3efae1f-06c5-48fc-b641-2ec7fdd31eb9.nupkg

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.

b2c4bc4b-5c10-400e-8a58-119642d5b4ef.zip

cc48a845-e67c-4faa-8585-19d5eafa7e7f.nupkg

**Following Activities are included in this package:**

Edit / Distance Based

- Levenshtein
- Damerau Levenshtein (Restricted and Default)
- Weighted Levenshtein
- Euclidean Distance
- Hamming Distance
- Jaro Distance
- Jaro Winkler
- Chapman Mean Length
- Chapman Length Deviation
- Minkowski Distance 

Sequence / Alignment Based

- Smith Waterman
- Smith Waterman Gotoh
- Smith Waterman Gotoh Windowed Affine
- Needleman–Wunsch
- Ratcliff Obershelp
- Longest Common Subsequence (LCS) 

Token Based

- Jaccard Index
- Sørensen–Dice coefficient
- Block Distance
- Tversky Index
- Overlap coefficient.
- Matching Coefficient
- Cosine Similarity
- Q-Grams
- N-Grams 

Hybrid Algorithms

- SIFT4
- Monge Elkan
- Generalized Compression Distance

Phonetic / Sound Based

- Soundex
- Metaphone
- Caverphone
- Double Metaphone
- Match Rating approach 

String Hash Based

- SimHash
- MinHash 

Fuzzy Wuzzy Algorithms

- Fuzzy Ratio

1. Simple Ratio
2. Partial Ratio
3. Token Sort Ratio
4. Token Set Ratio
5. Token Initialism Ratio
6. Weighted Ratio

- Fuzzy Token Abbreviation Ratio
- Fuzzy Process Extraction 

Extension Activities

- Get Similarities.
- Get Minimum Similarity.
- Get Minimum Similarities .
- Get Maximum Similarity.
- Get Maximum Similarities.
- Get Threshold Matches (Contains Fuzzy) 

String Cleanup Helpers

- String Cleanup
- HTML Tag Cleanup
- Unicode Normalize
- Clean Accent Characters
- Graphics Cleanup
- Whitespace Cleanup
- Other Cleanup

 

 

5f623915-664c-4165-9a7f-63982bbc9697.png

35c16db8-6075-4104-be66-739aeebac395.png

26d563ed-797c-484c-ae68-988ccc499264.png

21bc99a2-4450-4de1-806c-b760d3d1fff2.png

52e4d5cb-f0b5-402e-bd58-81479e5242f2.png

4239f9e8-7668-427d-ba50-00de47a3797d.docx

6f01e8d6-7c74-47d7-97f2-48203a60043e.zip

String Similarity Algorithms (Matching Percentage)