Get to know Tausworthe better with 2 real example sentences.
Tausworthe in a sentence
Context around Tausworthe
- Average sentence length in these examples: 24 words
- Position in the sentence: 2 start, 0 middle, 0 end
- Sentence types: 2 statements, 0 questions, 0 exclamations
Corpus analysis for Tausworthe
- In this selection, "tausworthe" usually appears near the start of the sentence. The average example has 24 words, and this corpus slice is mostly made up of statements.
- Around the word, 1997 and proposes stand out and add context to how "tausworthe" is used.
- Recognizable usage signals include tausworthe 1997 294 and tausworthe proposes that. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "tausworthe" sits close to words such as aabb, aabria and aacha, which helps place it inside the broader word index.
Example types with tausworthe
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
Tausworthe proposes that a measure of the complexity of a program be the length of its correctness proof. (18 words)
Tausworthe 1997:294 Measuring and improving the Euclid algorithms Elegance (compactness) versus goodness (speed): With only six core instructions, "Elegant" is the clear winner, compared to "Inelegant" at thirteen instructions. (30 words)
Tausworthe 1997:294 Measuring and improving the Euclid algorithms Elegance (compactness) versus goodness (speed): With only six core instructions, "Elegant" is the clear winner, compared to "Inelegant" at thirteen instructions. (30 words)
Tausworthe proposes that a measure of the complexity of a program be the length of its correctness proof. (18 words)
Example sentences (2)
Tausworthe 1997:294 Measuring and improving the Euclid algorithms Elegance (compactness) versus goodness (speed): With only six core instructions, "Elegant" is the clear winner, compared to "Inelegant" at thirteen instructions.
Tausworthe proposes that a measure of the complexity of a program be the length of its correctness proof.