oracle/fastr

Implement the `adist` builtin

Open

#102 opened on Sep 16, 2019

View on GitHub
 (2 comments) (0 reactions) (1 assignee)Java (63 forks)auto 404
enhancementgood first issue

Repository metrics

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

Description

From the documentation: Compute the approximate string distance between character vectors. The distance is a generalized Levenshtein (edit) distance, giving the minimal possibly weighted number of insertions, deletions and substitutions needed to transform one string into another.

Contributor guide

Research direction
Study the R documentation for adist and implement the weighted Levenshtein distance in the FastR runtime.
Tech stack
java
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
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.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Rstring algorithms
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
50