commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF GitHub Bot (JIRA)" <>
Subject [jira] [Work logged] (TEXT-126) Dice's Coefficient Algorithm in String similarity
Date Thu, 07 Mar 2019 13:53:00 GMT


ASF GitHub Bot logged work on TEXT-126:

                Author: ASF GitHub Bot
            Created on: 07/Mar/19 13:52
            Start Date: 07/Mar/19 13:52
    Worklog Time Spent: 10m 
      Work Description: aherbert commented on issue #103: TEXT-126: Adding Sorensen-Dice similarity
   I've had more of a think and have mocked an implementation for a generic `IntersectionSimilarity`.
   See [TEXT-155]( and the code
in the linked PR.
   This class can be used to compute the Sorensen-Dice similarity for bigrams or any other
type of structure that you would like to analyse from the `CharSequence`, e.g. characters,
bigrams, trigrams, n-grams, words, etc.
   Note: Sorensen-Dice similarity is the same as the F1-score
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
For queries about this service, please contact Infrastructure at:

Issue Time Tracking

    Worklog Id:     (was: 209583)
    Time Spent: 8h 40m  (was: 8.5h)

> Dice's Coefficient Algorithm in String similarity
> -------------------------------------------------
>                 Key: TEXT-126
>                 URL:
>             Project: Commons Text
>          Issue Type: Improvement
>            Reporter: Vicky Chawda
>            Priority: Major
>          Time Spent: 8h 40m
>  Remaining Estimate: 0h
> I'd like to propose an extension to the algorithms for string similarity in *commons-text/src/main/java/org/apache/commons/text/similarity/*
>  Dice's Coefficient Algorithm can be helpful for many who are looking for ranking similarities
in strings.
> *Inspired from* - []

This message was sent by Atlassian JIRA

View raw message