Tracking Amendments to Legislation and Other Political Texts with a Novel Minimum-Edit-Distance Algorithm: DocuToads

08/23/2016
by   Henrik Hermansson, et al.
0

Political scientists often find themselves tracking amendments to political texts. As different actors weigh in, texts change as they are drafted and redrafted, reflecting political preferences and power. This study provides a novel solution to the prob- lem of detecting amendments to political text based upon minimum edit distances. We demonstrate the usefulness of two language-insensitive, transparent, and efficient minimum-edit-distance algorithms suited for the task. These algorithms are capable of providing an account of the types (insertions, deletions, substitutions, and trans- positions) and substantive amount of amendments made between version of texts. To illustrate the usefulness and efficiency of the approach we replicate two existing stud- ies from the field of legislative studies. Our results demonstrate that minimum edit distance methods can produce superior measures of text amendments to hand-coded efforts in a fraction of the time and resource costs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2018

Revisiting the tree edit distance and its backtracing: A tutorial

Almost 30 years ago, Zhang and Shasha published a seminal paper describi...
research
11/03/2021

An Improved Algorithm for The k-Dyck Edit Distance Problem

A Dyck sequence is a sequence of opening and closing parentheses (of var...
research
05/29/2018

Semantically-informed distance and similarity measures for paraphrase plagiarism identification

Paraphrase plagiarism identification represents a very complex task give...
research
06/22/2022

Gaining Insights on U.S. Senate Speeches Using a Time Varying Text Based Ideal Point Model

Estimating political positions of lawmakers has a long tradition in poli...
research
05/08/2020

Text-Based Ideal Points

Ideal point models analyze lawmakers' votes to quantify their political ...
research
07/30/2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]

The inference of minimum spanning arborescences within a set of objects ...
research
05/25/2016

SS4MCT: A Statistical Stemmer for Morphologically Complex Texts

There have been multiple attempts to resolve various inflection matching...

Please sign up or login with your details

Forgot password? Click here to reset