Canonical decomposition
Encyclopedia : C : CA : CAN : Canonical decomposition
In Unicode, canonical decomposition is a process of converting composite characters into canonically-ordered strings of simpler characters using Unicode canonical mappings. The procedure of decomposition may be applied recursively; that is, the characters in the decomposition string may be decomposed further. Any canonical decomposition of a character is a string that is canonically equivalent to the original character.
If a character is not decomposable, then its canonical decomposition is equal to itself.
See also
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.