Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Approximate string matching and Information integration

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Approximate string matching and Information integration

Approximate string matching vs. Information integration

In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). Information integration (II) is the merging of information from heterogeneous sources with differing conceptual, contextual and typographical representations.

Similarities between Approximate string matching and Information integration

Approximate string matching and Information integration have 1 thing in common (in Unionpedia): String metric.

String metric

In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching or comparison and in fuzzy string searching.

Approximate string matching and String metric · Information integration and String metric · See more »

The list above answers the following questions

Approximate string matching and Information integration Comparison

Approximate string matching has 32 relations, while Information integration has 10. As they have in common 1, the Jaccard index is 2.38% = 1 / (32 + 10).

References

This article shows the relationship between Approximate string matching and Information integration. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »