The differential equation of Abrams and Strogatz for the competition between two languages is compared with agent based Monte Carlo simulations for fully connected networks as well as for lattices in one, two and three dimensions, with up to 10^9 agents. In the case of socially equivalent languages, agent-based models and a mean- eld approximation give grossly different results.