Hi, I'm Ask INFA!
What would you like to know?
ASK INFAPreview
Please to access Ask INFA.

Table of Contents

Search

  1. Preface
  2. Working with Transformations
  3. Aggregator Transformation
  4. Classifier Transformation
  5. Cleanse transformation
  6. Comparison Transformation
  7. Custom Transformation
  8. Custom Transformation Functions
  9. Consolidation Transformation
  10. Data Masking Transformation
  11. Data Masking Examples
  12. Decision Transformation
  13. Dynamic Lookup Cache
  14. Expression Transformation
  15. External Procedure Transformation
  16. Filter Transformation
  17. HTTP Transformation
  18. Identity Resolution Transformation
  19. Java Transformation
  20. Java Transformation API Reference
  21. Java Expressions
  22. Java Transformation Example
  23. Joiner Transformation
  24. Key Generator Transformation
  25. Labeler Transformation
  26. Lookup Transformation
  27. Lookup Caches
  28. Match Transformation
  29. Match Transformations in Field Analysis
  30. Match Transformations in Identity Analysis
  31. Merge Transformation
  32. Normalizer Transformation
  33. Parse transformation
  34. Rank Transformation
  35. Router Transformation
  36. Rule Specification transformation
  37. Sequence Generator Transformation
  38. Sorter Transformation
  39. Source Qualifier Transformation
  40. SQL Transformation
  41. Using the SQL Transformation in a Mapping
  42. Stored Procedure Transformation
  43. Standardizer Transformation
  44. Transaction Control Transformation
  45. Union Transformation
  46. Unstructured Data Transformation
  47. Update Strategy Transformation
  48. Verifier transformation
  49. Weighted Average Transformation
  50. XML Transformations

Transformation Guide

Transformation Guide

Edit Distance

Edit Distance

Use the Edit Distance algorithm to compare words or short text strings, such as names.
The Edit Distance algorithm calculates the minimum “cost” of transforming one string to another by inserting, deleting, or replacing characters.

Edit Distance Example

Consider the following strings:
  • Levenston
  • Levens
    h
    t
    ei
    n
The highlighted characters indicate the operations required to transform one string into the other.
The Edit Distance algorithm divides the number of unchanged characters (8) by the length of the longest string (11). In this example, the strings are 72.7% similar and the match score is
0.727
.

0 COMMENTS

We’d like to hear from you!