Skip to content
Lizely

Palindrome Checker

Check words, phrases, sentences, or numbers against a documented forward-and-backward rule after transparent Unicode, case, and punctuation normalization.

Privacy: your files never leave your device. All processing happens locally in your browser.

How to use

  1. 1.Enter a word, phrase, sentence, or number to test.
  2. 2.Run the checker and inspect the normalized letters-and-numbers string used for comparison.
  3. 3.Read the verdict and retained-character count, then compare the stated normalization with any contest-specific rule.

About Palindrome Checker

Palindrome Checker determines whether text reads the same forward and backward after one explicit normalization policy. Enter a word, phrase, sentence, or number, run the check, and inspect both the verdict and the exact comparison string. Processing happens entirely in the browser with no account or upload.

The sourced definition is the familiar one: a palindrome reads the same backward or forward. Merriam-Webster gives examples ranging from dad and 1881 to phrases such as race car and A man, a plan, a canal: Panama. Those examples anchor the externally asserted behavior instead of relying only on round-trip tests.

For this interface, comparison ignores uppercase versus lowercase, spaces, punctuation, symbols, and emoji. It retains Unicode letters and numbers, applies Unicode NFKC normalization, and lowercases with a fixed English locale. The normalized string is displayed so visitors can see exactly what was compared.

A man, a plan, a canal: Panama becomes amanaplanacanalpanama and returns yes. Hello becomes hello and returns no. Accented letters are retained rather than stripped: Été normalizes to été and is a palindrome under the code-point comparison used here.

The checker compares Unicode code points from the two ends toward the center and stops at the first mismatch. It does not reverse raw UTF-16 code units, so supplementary characters are not split. Emoji are excluded by the published letters-and-numbers scope rather than used as comparison units.

Input must contain at least one retained letter or number. A value containing only punctuation, whitespace, or emoji returns an explicit error instead of declaring an empty string palindromic. Empty input, malformed UTF-16, and over-limit text also fail without a partial verdict.

The input ceiling is one million Unicode code points. This bound keeps normalization, filtering, preview rendering, and comparison memory predictable while supporting long passages. The tool never truncates source text to manufacture a result.

Normalization can make compatibility characters compare alike, but it is not language-specific transliteration. The tool does not remove accents, expand every language-specific equivalence, compare pronunciations, identify word boundaries, or decide whether a sentence is meaningful. It checks the visible published spelling rule only.

The normalized preview may be long, so it appears in a bounded scrollable panel with the exact retained-character count. The verdict is based on that same string. There is no random behavior, dictionary lookup, remote model, hidden scoring threshold, or server calculation.

Use the checker for wordplay, classroom examples, puzzle verification, identifiers, numeric sequences, or debugging a normalization rule. It is not a DNA palindrome analyzer, cryptographic tool, plagiarism detector, semantic similarity system, or proof that two differently written phrases mean the same thing.

Case and punctuation policies vary among palindrome challenges. A strict character-for-character checker would classify phrases differently. This page states and exposes its normalization so the result can be reproduced. If a contest specifies another rule, follow that contest rather than assuming this output is universal.

The evidence pack includes the dictionary definition and eight positive and negative examples. Isolated tests cover phrases, numbers, Unicode accents, punctuation-only input, malformed Unicode, and errors. The implementation derives one normalized string, counts it, and compares symmetric positions without mutating the source or contacting a service.

Methodology & sources

Reject empty, malformed-Unicode, or over-one-million-code-point input; apply NFKC normalization and fixed English-locale lowercase; iterate by Unicode code point and retain only characters matching Unicode Letter or Number properties; reject an empty retained sequence; compare symmetric code-point positions from both ends until the center or first mismatch; return the exact normalized string, retained count, and boolean verdict; render those same values without remote requests.

Frequently asked questions

Are spaces and punctuation ignored?
Yes. This tool compares only Unicode letters and numbers after case and NFKC normalization.
Are accents removed?
No. Accented letters remain; the tool does not perform language transliteration.
Why does punctuation-only input return an error?
At least one letter or number is required so an empty normalized string is not reported as a meaningful palindrome.
Is my text uploaded?
No. Normalization, filtering, counting, and comparison run locally.

Related tools

Text Tools guides

View all