Write a program or function in any language that takes as an argument (command-line or function) a single English word. It returns or outputs the pluralized form of the word.
(To clarify, the program or function will be executed many times on different words, but separately - the list of words won't be passed all at once.)
The score of a program or function is
-(characters in program + 1) * number of wrong answers. Highest score wins. Joke answers will likely lose by a huge margin (I'm planning on putting in maybe 1,000 words) and if you're amazing you get the highest score of 0.
Example test data:
woman turn fly court finger blitz pie injury vertex alleyway alloy ox goose mouse house louse waffle right bacterium virus cherub chaetognath boy man shaman figure prefix etc.
Those are just some that I picked off the top of my head. The real test cases will have even stranger plurals, but the distribution between types of suffixes will be more even.
No Mathematica. Sorry.