Javascript must be enabled to continue!
Hear No Sievers, See No Sievers: Metrics and the Eddic Commentary Tradition
View through CrossRef
AbstractThis article explores a gradual shift towards metrical and linguistic imprecision in the four major commentaries on the Old Norse Eddic poems produced from the 1930s to today. This trend both affects and reflects the state of Eddic scholarship at large. Many scholars today do not avail themselves of metrical and linguistic criteria in the dating and textual restitution of Eddic poems but approach these issues either with agnosticism or by presenting vague arguments in favour of particular dates or variants. During the last three decades, however, testing along many parameters has placed the essentials of Eduard Sievers’ metrical analysis (1893) beyond reasonable doubt, which means that the gradual abandonment of precise description has taken place in a context where the preconditions for such description were improving. These analytical advances and mainstream Eddic scholarship have yet to meet, and the present article aims to facilitate such a convergence. Furthermore, since the Eddic commentaries will remain indispensable heuristic tools for the foreseeable future, the field of Old Norse philology stands to gain from a concise description of the implicit metrical and linguistic assumptions guiding their analysis.
Title: Hear No Sievers, See No Sievers: Metrics and the Eddic Commentary Tradition
Description:
AbstractThis article explores a gradual shift towards metrical and linguistic imprecision in the four major commentaries on the Old Norse Eddic poems produced from the 1930s to today.
This trend both affects and reflects the state of Eddic scholarship at large.
Many scholars today do not avail themselves of metrical and linguistic criteria in the dating and textual restitution of Eddic poems but approach these issues either with agnosticism or by presenting vague arguments in favour of particular dates or variants.
During the last three decades, however, testing along many parameters has placed the essentials of Eduard Sievers’ metrical analysis (1893) beyond reasonable doubt, which means that the gradual abandonment of precise description has taken place in a context where the preconditions for such description were improving.
These analytical advances and mainstream Eddic scholarship have yet to meet, and the present article aims to facilitate such a convergence.
Furthermore, since the Eddic commentaries will remain indispensable heuristic tools for the foreseeable future, the field of Old Norse philology stands to gain from a concise description of the implicit metrical and linguistic assumptions guiding their analysis.
Related Results
Eddic Poetry
Eddic Poetry
Rather than being a genre in its own right, “Eddic poetry” is essentially a body of poetry dealing with Old Nordic mythology and Old Nordic/Germanic heroes that was preserved for t...
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
Blogging Illness: Recovering in Public
Blogging Illness: Recovering in Public
As a mode of open access public self-expression, blogs are one form of the unfolding massification of culture (Lovink). Though widely varied in content and style, they are characte...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...
The Aα-eigenvalues of the generalized subdivision graph
The Aα-eigenvalues of the generalized subdivision graph
Let [Formula: see text] be a graph with an adjacency matrix [Formula: see text] and a diagonal degree matrix [Formula: see text]. For any graph [Formula: see text] and a real numbe...
Ld(2,1)-labeling on T-graphs
Ld(2,1)-labeling on T-graphs
In this paper, we are concerned with the [Formula: see text]-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology [...

