| Dreadhead vs Kazuya | 15–12 | 55.56% |
| Dreadhead vs King | 12–12 | 50.00% |
| Dreadhead vs Reina | 16–7 | 69.57% |
| Dreadhead vs Jin | 14–8 | 63.64% |
| Dreadhead vs Bryan | 7–12 | 36.84% |
| Dreadhead vs Steve | 6–9 | 40.00% |
| Dreadhead vs Yoshimitsu | 6–8 | 42.86% |
| Dreadhead vs Hwoarang | 4–10 | 28.57% |
| Dreadhead vs Law | 8–5 | 61.54% |
| Dreadhead vs Fahkumram | 6–7 | 46.15% |
| Dreadhead vs Paul | 6–6 | 50.00% |
| Dreadhead vs Jun | 6–6 | 50.00% |
| Dreadhead vs Azucena | 8–4 | 66.67% |
| Dreadhead vs Feng | 7–3 | 70.00% |
| Dreadhead vs Dragunov | 4–6 | 40.00% |
| Dreadhead vs Lee | 8–2 | 80.00% |
| Dreadhead vs Devil Jin | 5–4 | 55.56% |
| Dreadhead vs Lars | 7–2 | 77.78% |
| Dreadhead vs Alisa | 4–5 | 44.44% |
| Dreadhead vs Xiaoyu | 4–4 | 50.00% |
| Dreadhead vs Victor | 3–5 | 37.50% |
| Dreadhead vs Asuka | 7–0 | 100.00% |
| Dreadhead vs Claudio | 3–4 | 42.86% |
| Dreadhead vs Leroy | 5–2 | 71.43% |
| Dreadhead vs Nina | 4–2 | 66.67% |
| Dreadhead vs Lili | 2–3 | 40.00% |
| Dreadhead vs Leo | 4–1 | 80.00% |
| Dreadhead vs Zafina | 3–1 | 75.00% |
| Dreadhead vs Raven | 1–3 | 25.00% |
| Dreadhead vs Eddy | 4–0 | 100.00% |
| Dreadhead vs Heihachi | 3–1 | 75.00% |
| Dreadhead vs Kuma | 3–0 | 100.00% |
| Dreadhead vs Jack-8 | 1–1 | 50.00% |
| Dreadhead vs Panda | 0–1 | 0.00% |
| Dreadhead vs Lidia | 1–0 | 100.00% |
Limitations
This data is often requested to give insight into which characters you have more trouble with than others, but it is not particularly helpful for that. The main issue is that it is heavily skewed by how strong the opponents you play are.
For example, this data suggests my worst matchup is clearly vs Reina, but that's just because most of those games are vs Yagami.
There is a way to account for this being worked on. The central idea is to assign each matchup a rating vs you which adjusts based on the result, much like the regular rating but also based on the rating of each player. With this, it would give a better summary of how well you perform vs each character.
In the meantime, this page is here to present the data as requested.