Unicode decomposed normalized form (NFD)
Normalize to Unicode Canonical Decomposition Form
Strings that look identical can have different underlying representations. The Unicode canonical decomposition form (NFD) ensures that equivalent strings have a unique binary representation. This is useful when strings contain accented characters which can have several ways to represent them.
Consider the string
"jalapeño" which contains 8 letters.
str = "jalapeño"; strlength(str)
ans = 8
Normalize the string using the
textanalytics.unicode.nfd function. Depending on your system, the output string may appear to be identical to the input string.
newStr = textanalytics.unicode.nfd(str)
newStr = "jalapeño"
View the number of code points in the new string.
ans = 9
Notice that the normalized representation includes one extra code point. In this case, the function splits the accented letter
"ñ" into two separate code points. Extract the 7th and 8th code points in the normalized string. Depending on your system, the output may appear to be a single character.
ans = "ñ"
Check that the strings
newStr are equal using the
== operator. The operator returns false because the strings have different underlying representations.
tf = str == newStr
tf = logical 0
str — Input text
string array | character vector | cell array of character vectors
Input text, specified as a string array, character vector, or cell array of character vectors.
["An example of a short sentence."; "A second short
 Unicode Standard Annex #15 Unicode Normalization Forms https://unicode.org/reports/tr15/