In this paper, we present a comparison of collocation-based similarity measures: Jaccard, Dice and Cosine similarity measures for the proper selection of additional search terms in query expansion. In addition, we consider two more similarity measures: average conditional probability (ACP) and normalized mutual information (NMI). ACP is the mean value of two conditional probabilities between a ...

We present larger-scale evidence overturning previous results, showing that among the many alternative phrasal lexical similarity measures based on word vectors, the Jaccard coefficient most increases the robustness of MEANT, the recently introduced, fully-automatic, state-of-the-art semantic MT evaluation metric. MEANT critically depends on phrasal lexical similarity scores in order to automat...

There are a number of errors in the axes labels for Fig 8, “Heat maps for comparative performance analysis of different decomposition levels of wavelet analysis (from left to right: Jaccard index, sensitivity, and specificity).” The publisher apologizes for the errors. Please see the corrected Fig 8 here. There is an error in the axis label for Fig 9, “Heat maps obtained by different methods wi...

Establishing accurate genetic similarity and dissimilarity between individuals is an essential and decisive point for clustering and analyzing inter and intra population diversity because different similarity and dissimilarity indices may yield contradictory outcomes. We assessed the variations caused by three commonly used similarity coefficients including Jaccard, Sorensen-Dice and Simple mat...

The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching and image segmentation. This paper evaluates the Jaccard coefficient on the the Cell/B.E.processor and the Intel R ©Xeon R ©dual-core platform. In our work, we have developed a novel parallel algorithm specially suited...

n-grams have been used widely and successfully for approximate string matching in many areas. s-grams have been introduced recently as an n-gram based matching technique, where di-grams are formed of both adjacent and non-adjacent characters. s-grams have proved successful in approximate string matching across language boundaries in Information Retrieval (IR). s-grams however lack precise defin...

The present study compared different similarity and dissimilarity coefficients and their influence in maize inbred line clustering. Ninety maize S0:1 inbred lines were used and genotyped with 25 microsatellite markers (simple sequence repeat). The simple matching, Rogers and Tanimoto, Russel and Rao, Hamann, Jaccard, Sorensen-Dice, Ochiai, and Roger's modified distance coefficients were compare...

We present a suite of algorithms for Dimension Independent Similarity Computation (DISCO) to compute all pairwise similarities between very high-dimensional sparse vectors. All of our results are provably independent of dimension, meaning that apart from the initial cost of trivially reading in the data, all subsequent operations are independent of the dimension; thus the dimension can be very ...