I call boilerplate having to repeat types because there’s no type inference, but this is not captured here.

Kolmogorov complexity would be a good denominator, but you’d end up with a higher boilerplate score if your language just uses longer keywords

Yeah I think just counting fully unique lines is going to really capture the repetitiveness of a language. I think you’d get more accurate results just asking people using pairwise ranking.

Like someone on lobste.rs says:

Or an unrelated point: who do you believe, this data or your lying eyes? Java and Perl are not similar in their verbosity!

How in the world does Ruby have a lower DRYness than Java? This person’s code just does not work. And Java is almost as high as Kotlin? I’ve done conversion of millions of lines of Java to Kotlin. Just a direct conversion alone will save you 20% of your lines, and that’s without even bothering to switch to Kotlin code style, so that’s with Streams and massive if statements rather than pattern matching.

LaTeX only has 67% uniqueness? Huh???

This article has major problems.