My point was that no one really has "learned" the ELL algorithms. Thom just put those up so he wouldn't have to explain commutators, but in reality, they aren't a set number of algorithms. It would be similar to comparing OLL algorithms to intuitive f2l. Your method probably requires a learned set vs. a group of intuitive commutators.
As for the algs I learned, they include (by colloquial names) OLL parity, Double Parity, opp 2cycle, PLL parity, and the 2 checkerboard 4cycles (named from bigcubes.com 5x5). I actually didn't need to learn any of these for ELL specifically, as I had known of them previously from 5x5 solving.
Also, did you forget to mention 3x3x3 algs such as U-Perms (or other dedge preserving 2 3-cycles) or H or Z perms (or other dedge preserving 4 2-cycles)? I know it's not efficient to pair up the dedges first, but, if they happen to be paired up already it would be. The reason I ask is because you claim to be able to handle all 8! cases with just a maximum of 3 algs, using just the list of algorithms above. I just want to make sure I understand your method. Another reason I mention that is because two of the 32 PLLs are U-Perms, and obviously 4 of the 2 2-cycle algs are PLL parity or regular two dedge flips.