👉 Uncased is a term used in computer science and linguistics to describe a special case of the N-gram problem. In this context, an "uncased" sequence refers to one where all characters are placed in their original order (i.e., no character is reversed or changed). For example, the word "programming" has 5 uncased sequences: "p", "r", "o", "m", and "g".
