| SF6Better vs Asuka | 12–4 | 75.00% |
| SF6Better vs Kazuya | 7–8 | 46.67% |
| SF6Better vs Yoshimitsu | 8–5 | 61.54% |
| SF6Better vs Dragunov | 9–4 | 69.23% |
| SF6Better vs Hwoarang | 7–4 | 63.64% |
| SF6Better vs Paul | 6–4 | 60.00% |
| SF6Better vs Xiaoyu | 5–4 | 55.56% |
| SF6Better vs Jin | 5–4 | 55.56% |
| SF6Better vs Lars | 6–2 | 75.00% |
| SF6Better vs Lee | 5–3 | 62.50% |
| SF6Better vs Law | 4–3 | 57.14% |
| SF6Better vs Feng | 1–6 | 14.29% |
| SF6Better vs Reina | 5–2 | 71.43% |
| SF6Better vs Eddy | 3–4 | 42.86% |
| SF6Better vs Bryan | 2–4 | 33.33% |
| SF6Better vs Victor | 4–2 | 66.67% |
| SF6Better vs Steve | 5–0 | 100.00% |
| SF6Better vs Alisa | 1–4 | 20.00% |
| SF6Better vs Lili | 4–0 | 100.00% |
| SF6Better vs Leo | 2–2 | 50.00% |
| SF6Better vs Claudio | 4–0 | 100.00% |
| SF6Better vs Lidia | 3–1 | 75.00% |
| SF6Better vs Anna | 3–1 | 75.00% |
| SF6Better vs Fahkumram | 4–0 | 100.00% |
| SF6Better vs Nina | 2–1 | 66.67% |
| SF6Better vs Leroy | 1–2 | 33.33% |
| SF6Better vs Jun | 2–1 | 66.67% |
| SF6Better vs Azucena | 2–1 | 66.67% |
| SF6Better vs Heihachi | 3–0 | 100.00% |
| SF6Better vs Devil Jin | 2–0 | 100.00% |
| SF6Better vs Panda | 2–0 | 100.00% |
| SF6Better vs Zafina | 2–0 | 100.00% |
| SF6Better vs Raven | 2–0 | 100.00% |
| SF6Better vs Kuma | 1–0 | 100.00% |
| SF6Better vs Clive | 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.