Migrate orphans which are below or equal to the distance threshold. The distance is according to the levenshtein algorithm. It will skip the auto-migration for a unit if multiple units with the same distance are found.
| Id | {{ row.id }} | Description | {{ row.description }} | Meaning | {{ row.meaning }} | Source | {{ row.source }} |
|---|