NFKC (Compatibility Composition)
Normalization Form KC: تفكيك توافقي ثم تركيب كنسي؛ يدمج الأحرف المتشابهة بصريًا (fi→fi، ²→2، Ⅳ→IV)؛ يُستخدم لمقارنة المعرّفات.
NFKC: Normalization for Identifiers and Search
NFKC (Normalization Form KC — Compatibility Decomposition followed by Canonical Composition) is the most useful normalization form for search engines, programming language identifiers, and any system that needs to treat visually or semantically similar characters as equivalent.
The "K" in NFKC stands for "Kompatibility" — beyond the canonical decompositions that NFC handles, NFKC also folds compatibility characters: Unicode code points that exist for historical or typographic reasons but represent the same abstract character as something already encoded.
What Compatibility Folding Does
Compatibility decompositions cover hundreds of character categories:
| Original | After NFKC | Category |
|---|---|---|
fi (U+FB01) |
fi |
Ligature |
² (U+00B2) |
2 |
Superscript |
℃ (U+2103) |
°C |
Symbol |
A (U+FF21) |
A |
Fullwidth |
a (U+FF41) |
a |
Fullwidth |
① (U+2460) |
1 |
Enclosed |
㎞ (U+338F) |
km |
Compatibility CJK |
ナ (U+FF85) |
ナ |
Halfwidth Katakana |
import unicodedata
# Ligature folding
assert unicodedata.normalize("NFKC", "file") == "file"
# Fullwidth ASCII folding (common in CJK input)
fw = "A1B2" # fullwidth
ascii_eq = unicodedata.normalize("NFKC", fw)
print(ascii_eq) # "A1B2"
# Superscript folding
assert unicodedata.normalize("NFKC", "x²") == "x2"
# Combined with casefold for case-insensitive search
def normalize_for_search(s: str) -> str:
return unicodedata.normalize("NFKC", s).casefold()
print(normalize_for_search("HELLOWORLD゙")) # "helloworld゛" → further processing needed
NFKC in Standards
Python identifiers: Python 3 uses NFKC normalization for identifiers. That means MyClass (fullwidth) is valid and equivalent to MyClass.
PRECIS (RFC 8264): The successor to stringprep for usernames and passwords uses NFKC as a normalization step.
IDNA (Internationalized Domain Names): Domain name processing uses NFKC.
Password hashing: Many systems apply NFKC before hashing to ensure finance and finance hash the same way.
NFKC vs NFC: The Trade-off
NFKC loses information — ² and 2 are distinct characters with different semantic roles, but NFKC makes them identical. This is intentional for search and identifiers but wrong for document storage. Never use NFKC as your storage format if you need to preserve superscripts, ligatures, or enclosed numbers.
Quick Facts
| Property | Value |
|---|---|
| Full name | Normalization Form Compatibility Composition |
| Algorithm | NFKD first, then canonical composition |
| Python identifiers | Normalized with NFKC (PEP 3131) |
| PRECIS framework | RFC 8264 uses NFKC |
| Python | unicodedata.normalize("NFKC", s) |
| Lossy? | Yes — compatibility distinctions are discarded |
| Typical use | Search normalization, identifier comparison, password processing |
| Handles accents? | Yes (also decomposes/recomposes canonical characters) |
المصطلحات ذات الصلة
المزيد في الخوارزميات
Mapping characters to a common case form for case-insensitive comparison. More comprehensive …
Rules (UAX#29) for determining where one user-perceived character ends and another begins. …
Normalization Form C: تفكيك ثم إعادة تركيب كنسيًا، مما ينتج أقصر صيغة؛ …
Normalization Form D: تفكيك كامل دون إعادة تركيب؛ تستخدمه نظام ملفات macOS …
Normalization Form KD: تفكيك توافقي دون إعادة تركيب؛ التطبيع الأكثر عدوانية، مع …
Comparing Unicode strings requires normalization (NFC/NFD) and optionally collation (locale-aware sorting). Binary …
أحرف مستثناة من التركيب الكنسي (NFC) لمنع تفكيك non-starter وضمان استقرار الخوارزمية؛ …
عملية تحويل نص Unicode إلى صيغة كنسية موحدة؛ أربع صيغ: NFC (مركّب)، …
خوارزميات لإيجاد الحدود في النص: حدود grapheme cluster والكلمة والجملة؛ حاسمة لحركة …
الموضع بين الجمل وفقًا لقواعد Unicode؛ أكثر تعقيدًا من الفصل على النقاط …