Hi, thanks for the suggestion! Yeah that's a neat idea. The current logic is a bit simplistic and could be smarter.

My first thought is to calculate the longest common substring (maybe with a library like common-substrings) and use that to determine groupings. Although that approach gives me some unexpected results:

const commonSubstrings = require('common-substrings');

const tests = [
    'My Work 1',
    'My Work 2',
    'My Work 3',
    'His Work 1',
    'His Work 2',
    'His Work 3',
    'Their Work 1',
    'Their Work 2',
    'Their Work 3',
];

commonSubstrings(tests);

/*
[
  { source: [0, 1, 2], name: "My Work ", weight: 24 },
  { source: [0, 3, 6], name: " Work 1", weight: 21 },
  { source: [1, 4, 7], name: " Work 2", weight: 21 },
  { source: [2, 5, 8], name: " Work 3", weight: 21 },
  { source: [3, 4, 5], name: "His Work ", weight: 27 },
  { source: [6, 7, 8], name: "Their Work ", weight: 33 },
]
*/

The common substring of ' Work ' isn't detected, so oddly enough this would still lead to a RegEx like

/(Their Work (1|2|3)|His Work (1|2|3)|My Work (1|2|3))/

Maybe your example is a particularly hard one; I'm sure this approach would still be useful in other cases like:

One fish
Two fish
Red fish
Blue fish

Is this a feature you'd like to work on?

Description

Metadata

Metadata

Assignees

Labels

Projects

Milestone

Relationships

Development

Issue actions