Key points are not available for this paper at this time.
Recent advances in computational content analysis have provided scholars promising new ways for estimating party positions. However, existing text‐based methods face challenges in producing valid and reliable time‐series data. This article proposes a scaling algorithm called WORDFISH to estimate policy positions based on word frequencies in texts. The technique allows researchers to locate parties in one or multiple elections. We demonstrate the algorithm by estimating the positions of German political parties from 1990 to 2005 using word frequencies in party manifestos. The extracted positions reflect changes in the party system more accurately than existing time‐series estimates. In addition, the method allows researchers to examine which words are important for placing parties on the left and on the right. We find that words with strong political connotations are the best discriminators between parties. Finally, a series of robustness checks demonstrate that the estimated positions are insensitive to distributional assumptions and document selection.
Building similarity graph...
Analyzing shared references across papers
Loading...
Jonathan Slapin
Sven‐Oliver Proksch
American Journal of Political Science
University of California, Los Angeles
Trinity College Dublin
Building similarity graph...
Analyzing shared references across papers
Loading...
Slapin et al. (Tue,) studied this question.
www.synapsesocial.com/papers/69e18fe320b7100e21b97052 — DOI: https://doi.org/10.1111/j.1540-5907.2008.00338.x