Analyzing Walter Skeat's Forty-Five Parallel Extracts of William Langland's Piers Plowman

12/29/2015
by   Roger Bilisoly, et al.
0

Walter Skeat published his critical edition of William Langland's 14th century alliterative poem, Piers Plowman, in 1886. In preparation for this he located forty-five manuscripts, and to compare dialects, he published excerpts from each of these. This paper does three statistical analyses using these excerpts, each of which mimics a task he did in writing his critical edition. First, he combined multiple versions of a poetic line to create a best line, which is compared to the mean string that is computed by a generalization of the arithmetic mean that uses edit distance. Second, he claims that a certain subset of manuscripts varies little. This is quantified by computing a string variance, which is closely related to the above generalization of the mean. Third, he claims that the manuscripts fall into three groups, which is a clustering problem that is addressed by using edit distance. The overall goal is to develop methodology that would be of use to a literary critic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2022

Algorithm to derive shortest edit script using Levenshtein distance algorithm

String similarity, longest common subsequence and shortest edit scripts ...
research
03/13/2020

Knowledge Graph Alignment using String Edit Distance

In this work, we propose a novel knowledge base alignment technique base...
research
07/02/2019

Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing

Edit distance similarity search, also called approximate pattern matchin...
research
04/16/2021

Neural String Edit Distance

We propose the neural string edit distance model for string-pair classif...
research
07/16/2020

String Sanitization Under Edit Distance: Improved and Generalized

Let W be a string of length n over an alphabet Σ, k be a positive intege...
research
07/31/2020

Improved Time Warp Edit Distance – A Parallel Dynamic Program in Linear Memory

Edit Distance is a classic family of dynamic programming problems, among...

Please sign up or login with your details

Forgot password? Click here to reset