Predicting Party Group from the Lithuanian Parliamentary Speeches

Authors

  • J. Kapočiūtė-Dzikienė Vytautas Magnus University, Kaunas University of Technology
  • A. Krupavičius Kaunas University of Technology

DOI:

https://doi.org/10.5755/j01.itc.43.3.5871

Keywords:

computational linguistics, supervised machine learning, text classification into party groups

Abstract

A number of recent research works have used supervised machine learning approaches with a bag-of-words to classify political texts –in particular, speeches and debates– by their ideological position, expressed with a party membership. However, our classification task is more complex due to the several reasons. First, we deal with the Lithuanian language which is highly inflective, has rich morphology, vocabulary, word derivation system, and relatively free-word-order in a sentence. Besides, we have more classes, as the Lithuanian Parliament consists of more party groups if compared to e.g. the European Parliament or the US Senate. Moreover, classes are not stable, because a considerable number of the Lithuanian parliamentarians migrate from one party group to another even within the same parliamentary term. In this research we experimentally investigated the influence of different pre-processing techniques and feature types on two datasets composed of the texts taken from two parliamentary terms. A classifier based on the bag-of-words and token bigrams interpolation gave the best results: i.e. it outperformed random and majority baselines by more than 0.13 points and achieved 0.54 and 0.49 accuracy on the 1st and the 2nd dataset, respectively. The error analysis revealed that the same confusion patterns stand for both datasets, besides, majority of these confusions can be explained on the basis of the ideological or pragmatic similarities between those party groups.

DOI: http://dx.doi.org/10.5755/j01.itc.43.3.5871

Downloads

Published

2014-09-24

Issue

Section

Articles