Wikipedia's trie article says:
[Compressing the trie representation by merging the common branches] is also typically used in the implementation of the various fast lookup tables needed to retrieve Unicode character properties (for example to represent case mapping tables, or lookup tables containing the combination of base and combining characters needed to support Unicode normalization). For such application, the representation is similar to transforming a very large unidimensional sparse table into a multidimensional matrix, and then using the coordinates in the hyper-matrix as the string key of an uncompressed trie. The compression will then consist of detecting and merging the common columns within the hyper-matrix to compress the last dimension in the key; each dimension of the hypermatrix stores the start position within a storage vector of the next dimension for each coordinate value, and the resulting vector is itself compressible when it is also sparse, so each dimension (associated to a layer level in the trie) is compressed separately.
This is all uncited! It says it is similar to "transforming a very large unidimensional sparse table into a multidimensional matrix". What is such a transformation, and how such a matrix is helpful to implementing a compressed trie? I've been unable to find anything. Obviously, not understanding this, I'm at a loss for how using the coordinates within that allow one to implement a trie!