Use Damerau-Levenshtein distance for finding best order in newspaper-order rule

Repository metrics

Stars

175 stars (175 stars)

PR merge metrics

No merged PRs in 30d (No merged PRs in 30d)

Description

Contributor guide

Research direction

Study the existing newspaper order rule implementation in the repository to understand the current ordering logic. Research the Damerau Levenshtein distance algorithm and how it can be applied to string comparison. Then implement the distance calculation and integrate it into the rule to replace the existing method.

Tech stack

typescript

Domain

developer experiencetooling

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.

Fresh

ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.

Clear

Prerequisites

TypeScriptDamerau Levenshtein distance

Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.

60