1998Digital Commons @ Butler University (Butler University)Requires access

Trisograms, Quadrisograms, Quintisograms

Eric Chaikin

Open publisher page 0 citations

Abstract

A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.

About this research paper

What this paper is about

A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.

Key concepts: Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Trisograms, Quadrisograms, Quintisograms — Research Paper | ScholarLens