smithoss/gonymizer

Discuss which string edit-difference algorithms should be supported

Open

#7 opened on Mar 8, 2019

View on GitHubContributor guide
 (0 comments) (0 reactions) (0 assignees)Go (34 forks)auto 404
help wantedquestion

Repository metrics

Stars
 (160 stars)
PR merge metrics
 (PR metrics pending)

Description

Currently we are using the Jaro-Winkler distance on most of our Faker output to make sure that we do not replace the data with anything that could be similar to the original. (see: https://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance) Code: https://github.com/smithoss/gonymizer/blob/master/processors.go#L220

I'm not even sure if this is the right one. I did some research when I first added this to the project, but after reviewing other algorithms, I found that others (based on Levenshtein distance as well) may be a better fit.

Also are these checks pointless since our string size is not the same except for the AlphaNumericScrambler?

Contributor guide

Research direction
Research string edit distance algorithms (Jaro Winkler, Levenshtein, etc.) and evaluate their suitability for anonymizing data in Gonymizer. Consider the impact of string length differences and provide a recommendation.
Tech stack
go
Domain
backenddatabase
Issue type
Research
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Needs investigation
Prerequisites
Go
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60