Why not? Central repositories could require that all names are within a certain Levenshtein distance of one another.
This could get mildly annoying every once in a while when there are legitimate non-clashing names. A better metric/typo recognition technique is probably possible. Or else some manual process for requesting exceptions (maybe with a tiny fee to help fund the overall project) would also address this problem.
EDIT: Just downloaded and read the thesis abstract. The author actually suggests the first idea: "The analytical part generates ideas
for countermeasures that allow repository maintainers or users to detect typosquatting attacks
in the future. For this purpose potential typosquatting candidates could be generated for each
legitimate package name with the help of the Levenshtein distance algorithms or Bayesian
networks. Another option that can be considered is the Metaphone algorithm."