Premium
A Scaling Model for Estimating Time‐Series Party Positions from Texts
Author(s) -
Slapin Jonathan B.,
Proksch SvenOliver
Publication year - 2008
Publication title -
american journal of political science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.347
H-Index - 170
eISSN - 1540-5907
pISSN - 0092-5853
DOI - 10.1111/j.1540-5907.2008.00338.x
Subject(s) - computer science , robustness (evolution) , series (stratigraphy) , word (group theory) , german , scaling , time series , politics , selection (genetic algorithm) , multidimensional scaling , data mining , algorithm , econometrics , artificial intelligence , machine learning , mathematics , political science , linguistics , law , paleontology , biochemistry , chemistry , geometry , philosophy , gene , biology
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.