Sparked by a remarkable result due to Hemaspaandra et al. [9], the voting rule attributed to Charles Dodgson has become one of the most studied voting rules in computational social choice. However, the computer science literature often neglects that Dodgson's rule has some serious shortcomings as a choice procedure. This short note contains four examples revealing Dodgson's deficiencies.