Fully-Firstable Anagram Sets
$begingroup$
Okay, first let's define some terminology:
- Anagram - Oh come on, how are you on Puzzling.SE if you don't know this one?
- Anagram Set - a list of words that are all anagrams of eachother, e.g.:
- ACTS
- CAST
- CATS
- SCAT
- Fully-Firstable - An anagram set where each of the letters can be found at the beginning of at least one of the words. The previous example would not qualify because there is no word starting with 'T'. One example would be:
- OPTS
- POST or POTS
- SPOT or STOP
- TOPS
I have been able to find a relatively small number of these. One optional rule I will allow to increase the chances of finding more is that if a set contains more than one of the same letter, you only need to have one word which starts with that letter, e.g. the set:
- EEL
- LEE
Only needs 2 words to qualify since there are only 2 unique letters.
I can easily find a number of 3- and 4-letter sets, but I am aware of only two 5-letter sets with this property, one of which uses the letter-doubling rule and one which does not. Can you find them? Are there more? Are there any with 6 or more letters?
Oh, let's disallow some things: No proper nouns or acronyms (unless these acronyms have since become commonly used as standard words such as "laser" or "scuba"), no splitting the letters into 2 or more words, stick to English please - my examples are relatively common words, but if you come up with any that use questionable or archaic words you might want to back them up with a reputable dictionary link. Also, screams, laughs, or other sound effects are not words. I'm looking at you, "AAAAAA" or "AHAHAH / HAHAHA". These are trivial to come up with and thus disqualified.
word no-computers anagram
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
$endgroup$
add a comment |
$begingroup$
Okay, first let's define some terminology:
- Anagram - Oh come on, how are you on Puzzling.SE if you don't know this one?
- Anagram Set - a list of words that are all anagrams of eachother, e.g.:
- ACTS
- CAST
- CATS
- SCAT
- Fully-Firstable - An anagram set where each of the letters can be found at the beginning of at least one of the words. The previous example would not qualify because there is no word starting with 'T'. One example would be:
- OPTS
- POST or POTS
- SPOT or STOP
- TOPS
I have been able to find a relatively small number of these. One optional rule I will allow to increase the chances of finding more is that if a set contains more than one of the same letter, you only need to have one word which starts with that letter, e.g. the set:
- EEL
- LEE
Only needs 2 words to qualify since there are only 2 unique letters.
I can easily find a number of 3- and 4-letter sets, but I am aware of only two 5-letter sets with this property, one of which uses the letter-doubling rule and one which does not. Can you find them? Are there more? Are there any with 6 or more letters?
Oh, let's disallow some things: No proper nouns or acronyms (unless these acronyms have since become commonly used as standard words such as "laser" or "scuba"), no splitting the letters into 2 or more words, stick to English please - my examples are relatively common words, but if you come up with any that use questionable or archaic words you might want to back them up with a reputable dictionary link. Also, screams, laughs, or other sound effects are not words. I'm looking at you, "AAAAAA" or "AHAHAH / HAHAHA". These are trivial to come up with and thus disqualified.
word no-computers anagram
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
$endgroup$
add a comment |
$begingroup$
Okay, first let's define some terminology:
- Anagram - Oh come on, how are you on Puzzling.SE if you don't know this one?
- Anagram Set - a list of words that are all anagrams of eachother, e.g.:
- ACTS
- CAST
- CATS
- SCAT
- Fully-Firstable - An anagram set where each of the letters can be found at the beginning of at least one of the words. The previous example would not qualify because there is no word starting with 'T'. One example would be:
- OPTS
- POST or POTS
- SPOT or STOP
- TOPS
I have been able to find a relatively small number of these. One optional rule I will allow to increase the chances of finding more is that if a set contains more than one of the same letter, you only need to have one word which starts with that letter, e.g. the set:
- EEL
- LEE
Only needs 2 words to qualify since there are only 2 unique letters.
I can easily find a number of 3- and 4-letter sets, but I am aware of only two 5-letter sets with this property, one of which uses the letter-doubling rule and one which does not. Can you find them? Are there more? Are there any with 6 or more letters?
Oh, let's disallow some things: No proper nouns or acronyms (unless these acronyms have since become commonly used as standard words such as "laser" or "scuba"), no splitting the letters into 2 or more words, stick to English please - my examples are relatively common words, but if you come up with any that use questionable or archaic words you might want to back them up with a reputable dictionary link. Also, screams, laughs, or other sound effects are not words. I'm looking at you, "AAAAAA" or "AHAHAH / HAHAHA". These are trivial to come up with and thus disqualified.
word no-computers anagram
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
$endgroup$
Okay, first let's define some terminology:
- Anagram - Oh come on, how are you on Puzzling.SE if you don't know this one?
- Anagram Set - a list of words that are all anagrams of eachother, e.g.:
- ACTS
- CAST
- CATS
- SCAT
- Fully-Firstable - An anagram set where each of the letters can be found at the beginning of at least one of the words. The previous example would not qualify because there is no word starting with 'T'. One example would be:
- OPTS
- POST or POTS
- SPOT or STOP
- TOPS
I have been able to find a relatively small number of these. One optional rule I will allow to increase the chances of finding more is that if a set contains more than one of the same letter, you only need to have one word which starts with that letter, e.g. the set:
- EEL
- LEE
Only needs 2 words to qualify since there are only 2 unique letters.
I can easily find a number of 3- and 4-letter sets, but I am aware of only two 5-letter sets with this property, one of which uses the letter-doubling rule and one which does not. Can you find them? Are there more? Are there any with 6 or more letters?
Oh, let's disallow some things: No proper nouns or acronyms (unless these acronyms have since become commonly used as standard words such as "laser" or "scuba"), no splitting the letters into 2 or more words, stick to English please - my examples are relatively common words, but if you come up with any that use questionable or archaic words you might want to back them up with a reputable dictionary link. Also, screams, laughs, or other sound effects are not words. I'm looking at you, "AAAAAA" or "AHAHAH / HAHAHA". These are trivial to come up with and thus disqualified.
word no-computers anagram
word no-computers anagram
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
asked 6 mins ago
Darrel HoffmanDarrel Hoffman
2,0811021
2,0811021
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81384%2ffully-firstable-anagram-sets%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81384%2ffully-firstable-anagram-sets%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
