I think that password entropy could be calculated from standard deviation of code points: log2((deviation * 2) ** length
.
The log2 converts the entropy in bits.
Indeed, unicode points are grouped by subsets. All latin characters have close code points. It's the same for other alphabets and mathematic symbols. They are grouped together. So it makes sens to compute the password entropy from the standard deviation of all used code points.