Skip to content
induwara.lk
Premium
induwara.lkAI · Speech recognition

Word Error Rate (WER) Calculator

Paste a reference transcript and a model hypothesis to get the exact Word Error Rate — with substitution, deletion, and insertion counts, accuracy, MER, an optional character-level CER, and a colour-coded alignment. Uses the NIST WER definition, runs in your browser, no signup.

By Induwara AshinsanaUpdated Jul 8, 2026
Word Error Ratereference vs. hypothesis
NIST WER formula

The correct transcript you are scoring against.

The ASR or model transcript to evaluate.

Load example
WER
22.22%
Accuracy
77.78%
MER
22.22%
Match Error Rate (bounded 0–100%)
Edit distance
2
S + D + I over 9 words

Error breakdown

CategoryCount
Correct (C)7
Substitutions (S)1
Deletions (D)1
Insertions (I)0
Reference length (N)9

Alignment

CorrectSubstitutionDeletion (missing)Insertion (extra)
thequickbrownfoxjumpsjumpedoverthelazydog

Runs fully in your browser — nothing is uploaded. Alignment cross-checked against an independent Levenshtein distance: verified ✓.

How it works

Word Error Rate is the standard accuracy metric for automatic speech recognition (ASR) and, increasingly, for LLM transcription. It answers a single question: of the words a system should have produced, what fraction did it get wrong? The definition and the alignment convention this tool follows come from the NIST Speech Recognition Scoring Toolkit (SCTK, thesclite scorer used in NIST ASR evaluations).

The computation is four deterministic steps:

  1. Normalise and tokenise. Both transcripts are lowercased (unless you keep case), stripped of a fixed punctuation set (unless you keep punctuation), and split on whitespace into words. In Character mode the same text is split into characters for CER.
  2. Align by minimum edit distance. A Levenshtein dynamic programming matrix is built over the two token streams with unit costs: D[i][j] = min(D[i-1][j-1] + (ref≠hyp), D[i-1][j] + 1, D[i][j-1] + 1). A match costs 0; a substitution, deletion, or insertion costs 1.
  3. Backtrace and count. Tracing the cheapest path back from the bottom-right corner recovers each operation, giving the number of substitutions (S), deletions (D), insertions (I), and correct matches (C). This is the SCTK counting convention.
  4. Compute the metrics. The headline figure is WER = (S + D + I) / N, where N is the reference length. Accuracy is 1 − WER. The tool also reports MER = (S + D + I) / (S + D + I + C), from Morris, Maier & Green (2004), which stays bounded to 100% even when WER does not.

The sum S + D + I is exactly the Levenshtein edit distance between the two token streams, so the calculator recomputes that distance a second, independent way and confirms the two agree — the “verified ” badge in the results footer. A deletion means a reference word is missing from the hypothesis; an insertion means the hypothesis added a word that isn’t in the reference. Because insertions are counted but only reference words are in the denominator, WER can rise above 100% — a real property of the metric, not an error. The colour-coded alignment shows precisely which words were substituted, dropped, or added, so you can see whether the errors cluster on proper nouns, numbers, or filler words and act accordingly (for example, adding a custom vocabulary).

Worked examples

Example 1 — a typical transcription slip (WER = 22.22%)

  1. Reference: "the quick brown fox jumps over the lazy dog" (N = 9)
  2. Hypothesis: "the quick brown fox jumped over lazy dog"
  3. jumps → jumped is a substitution (S = 1)
  4. the second "the" is missing → deletion (D = 1); no insertions (I = 0)
  5. 7 words correct (C = 7)
  6. WER = (1 + 1 + 0) / 9 = 2/9 = 22.22%; Accuracy = 77.78%
  7. MER = 2 / (2 + 7) = 22.22% (equal to WER because I = 0)

Example 2 — WER above 100% (WER = 125%)

  1. Reference: "she sells sea shells" (N = 4)
  2. Hypothesis: "she sell sea shell by the shore"
  3. sells → sell and shells → shell are substitutions (S = 2)
  4. by, the, shore are all extra → insertions (I = 3); D = 0
  5. she and sea correct (C = 2)
  6. WER = (2 + 0 + 3) / 4 = 5/4 = 125% — over 100% is valid
  7. MER = 5 / (5 + 2) = 71.43% (stays bounded below 100%)

Example 3 — empty hypothesis (WER = 100%)

  1. Reference: "hello world" (N = 2)
  2. Hypothesis: (empty)
  3. Every reference word is missing → deletions (D = 2)
  4. S = 0, I = 0, C = 0
  5. WER = (0 + 2 + 0) / 2 = 2/2 = 100%; Accuracy = 0%
  6. A blank transcription always scores exactly 100% WER.

Frequently asked questions

Sources & references

The WER formula and alignment follow the NIST SCTK (sclite) WER definition; the metrics were last cross-checked against these sources on 2026-07-08. The two worked examples above (22.22% and 125%) are reproduced exactly by the calculator.

Related tools

Rate this tool
Be the first to rate

Comments & feedback

Spotted a bug or want an improvement? Tell us — our team reviews every comment, and good ideas get built. Comments are public and anonymous.

Found a bug, edge case, or want to suggest an improvement?

Email me at [email protected] — most fixes ship within 24 hours.