Skip to content

Introduce IndelNew as an alternative to partial ratio strategy - #31

Draft
ycherkes wants to merge 4 commits into
masterfrom
indel-new-as-an-alternative-to-partial-ratio
Draft

Introduce IndelNew as an alternative to partial ratio strategy#31
ycherkes wants to merge 4 commits into
masterfrom
indel-new-as-an-alternative-to-partial-ratio

Conversation

@ycherkes

@ycherkes ycherkes commented Jul 25, 2026

Copy link
Copy Markdown
Contributor

Introduce IndelNew as an alternative to partial ratio strategy

Pattern length 64 benchmark comparison

Text Dataset Before After Improvement PartialRatio After vs PartialRatio
1024 Exact match 4,411 ns 39.5 ns 111.7× faster 388.8 ns 9.8× faster
4096 Exact match 17,328 ns 118.4 ns 146.3× faster 508.9 ns 4.3× faster
1024 No exact match 4,328 ns 4,539 ns 4.9% slower 17,898 ns 3.9× faster
4096 No exact match 17,490 ns 17,122 ns 2.1% faster 59,556 ns 3.5× faster

ycherkes added 4 commits July 25, 2026 12:09
Use ordinal span search to bypass the Indel recurrence when an exact substring exists.
Apply the same optimization to cached and non-cached approximate substring ratio strategies while preserving earliest-match semantics.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant