Lemmy created a perfect regex of every possible variation of the n-word.

\bn(i|1)g(\b|g?(a|er)?(s|z)?)\b

https://github.com/LemmyNet/lemmy/blob/15710a05958fb7e3ba7249ae6c928b54aac09e70/lemmy_utils/src/utils.rs#L10