Word weaves were introduced by Steven Kahan in the Feb 2005 Word Ways. When the letters in the odd positions of a word appear alphabetized, we say that the word is odd-ascending and when these letters appear reverse alphabetized, we call the word odd-descending; even-ascending and even-descending are defined similarly. A word in which both the odd letters and the even letters are either ascendant or descendent is called a word weave. Here is a selection of such words of nine or more letters; all are to be found somewhere in the OED or Webster 2 except where noted
Logologists have been aware of word strings -- overlapping lists of words such as sat, ate, tea, ear...
For an introduction to this series of articles classifying and summarizing unsolved logological prob...
Readers of Word Ways should be familiar with the concept of word patterns, exemplified by Jack Levin...
When the letters in the odd positions of a word appear alphabetized, we say that the word is odd-asc...
Word ladders are strings of equal-length words that change one letter at each step. They have featu...
Many Word Ways articles have dealt with words differing from each other in only a single letter (suc...
My first contributions to Word Ways were on word ladders and networks. In Word Network Spans in th...
This article responds to the challenge posed by Susan Thorpe on page 212 of the August 2001 issue of...
THere are two ways to try this little teaser: either match the definitions in the left-hand (numbere...
In the first part of this article (May 1999), we presented words consisting solely of ascenders (bdf...
On March 13 2005, Will Shortz presented an interesting word puzzle on National Public Radio: rearran...
In the February 1979 Kickshaws, the late R. Robinson Rowe proposed Word Ladders which successfully r...
For an introduction to this series of articles classifying and summarizing unsolved logological prob...
The words HUTS, RUTS, ARMY, and DENE (British: valley ) have in common a property not too hard to d...
By the time we reach six-letter words, conditions for superior ladders are much improved: nearly one...
Logologists have been aware of word strings -- overlapping lists of words such as sat, ate, tea, ear...
For an introduction to this series of articles classifying and summarizing unsolved logological prob...
Readers of Word Ways should be familiar with the concept of word patterns, exemplified by Jack Levin...
When the letters in the odd positions of a word appear alphabetized, we say that the word is odd-asc...
Word ladders are strings of equal-length words that change one letter at each step. They have featu...
Many Word Ways articles have dealt with words differing from each other in only a single letter (suc...
My first contributions to Word Ways were on word ladders and networks. In Word Network Spans in th...
This article responds to the challenge posed by Susan Thorpe on page 212 of the August 2001 issue of...
THere are two ways to try this little teaser: either match the definitions in the left-hand (numbere...
In the first part of this article (May 1999), we presented words consisting solely of ascenders (bdf...
On March 13 2005, Will Shortz presented an interesting word puzzle on National Public Radio: rearran...
In the February 1979 Kickshaws, the late R. Robinson Rowe proposed Word Ladders which successfully r...
For an introduction to this series of articles classifying and summarizing unsolved logological prob...
The words HUTS, RUTS, ARMY, and DENE (British: valley ) have in common a property not too hard to d...
By the time we reach six-letter words, conditions for superior ladders are much improved: nearly one...
Logologists have been aware of word strings -- overlapping lists of words such as sat, ate, tea, ear...
For an introduction to this series of articles classifying and summarizing unsolved logological prob...
Readers of Word Ways should be familiar with the concept of word patterns, exemplified by Jack Levin...