Count consonants in text

This consonant counter gives you one clear answer: the number of English consonant letters in a piece of text. It ignores the vowels a, e, i, o, and u, as well as digits, spaces, punctuation, symbols, emoji, and non-ASCII characters. The result is useful when checking phonics exercises, studying the sound and letter balance of poetry, preparing word puzzles, or testing text-processing code. The calculation is deterministic and runs in a single pass, so the same input always produces the same integer.

What the consonant counter includes and excludes

The counter includes the twenty-one ASCII English letters that are not a, e, i, o, or u. In practical terms, b through z are tested case-insensitively and counted whenever they belong to that consonant set. Uppercase and lowercase forms are equivalent, so B and b each add one to the result.

The letter y counts as a consonant because this tool uses a fixed character rule rather than trying to infer pronunciation from a word. Every vowel is excluded, even when it appears in uppercase. Decimal digits, spaces, tabs, line breaks, punctuation marks, currency signs, mathematical symbols, and emoji are also excluded.

Non-ASCII letters, including accented characters, are not classified as English consonants and therefore do not increase the count. The tool does not estimate syllables, identify consonant sounds, analyze digraphs, or decide whether a letter is silent. It counts written characters according to a stable English alphabet rule, which is the useful level of precision for letter puzzles and mechanical text analysis.

How to submit text and interpret the result

Whitespace-only text is valid because it is real text under the contract, but its consonant count is zero. The same is true for a string made entirely of vowels, numbers, or punctuation. The algorithm visits each Unicode character once, normalizes only ASCII uppercase letters for comparison, rejects the five fixed vowels, and increments the counter for each remaining ASCII letter.

It never trims the input or changes its contents before scanning. A phrase such as “Bright stars” counts the consonant letters in both words while ignoring its space and vowels; adding 2026 or an exclamation mark does not change the answer. Because the implementation uses no dictionary, locale table, machine-learning model, network request, random value, or clock, repeated calls are deterministic.

Using consonant counts for language, poetry, and puzzles

A consonant total is a small measurement with several practical uses. Teachers can verify phonics worksheets and spelling activities without recounting every letter by hand, while students can check their own work and focus on why particular letters belong in the consonant group. Poetry readers and writers can compare lines with dense clusters of consonants, explore alliteration, or collect simple quantitative notes before performing a deeper analysis of rhythm and sound.

Puzzle makers can confirm constraints for riddles, word ladders, acrostics, and letter-selection games, and solvers can test candidate phrases quickly. Remember that this is an orthographic counter, not a phonetic transcription engine: it sees written letters and does not know that the same consonant can have different sounds or that two letters may form one sound. Run occasional checks free in the browser.

Since the calculation stores nothing and needs no outside service, it is also a straightforward choice for predictable, privacy-conscious text checks.