👉 In linguistics and computer science, a pseudo-astringent is a string of characters that behaves like an astringent but does not have all its characters strictly equal to each other. In other words, a pseudo-astringent can be considered as a string where some letters are significantly different from the rest. For example: - "hello" - it contains 3 distinct letters: h, e, l - "abcde" - it contains 4 distinct letters: b, c
