Jaccard Function

This form takes two sets of words and outputs the union, intersection and similarity between them.
For example, if we have two sets {A, B, C} and {C, D}, the output is the following:

Intersection {C}
Union {A, B, C, D}
Jaccard similarity 0.25

Input:				Output:
Set A				Intersection
Set B				Union
Words separated by				Jaccard Similarity
Advanced Options:
Ignore all diacritics but not shadda Ignore diacritics and Shadda ( ّ )

Other Projects:

Implication Function , Arabic Ontology , Curras , Zinnar