Compressed unicode normalization with inversion

摘要

Any string in any character set with an arbitrary-leveled weight-based comparison system is transformed into a bitstring in such a way that two transformed strings can be compared byte-by-byte. The resulting bit string has the minimum possible maximum length. The transformed bit strings can be inverted-meaning the original string can be recovered from the transformed string.