Wordplay subtraction paradoxWordplay addition paradoxWhat is a Refreshing Word™?Are you wishful for bees?I'm not a fat henAim the lasers upWord Association GRIDWordplay in an unknown domainInterlaced Word PairsNested word series [humans only]Five Letter Boxed puzzles with special solutionsWordplay addition paradox
What does "see" in "the Holy See" mean?
How did the Axis intend to hold the Caucasus?
Is there an antonym for "spicy" or "hot" regarding food (NOT "seasoned" but "spicy")?
Why was Sauron preparing for war instead of trying to find the ring?
How to tar a list of directories only if they exist
Does a Rogue's Evasion work for spells?
Is this photo showing a woman standing in the nude before teenagers real?
Why isn't there any 9.5 digit multimeter or higher?
Polyhedra, Polyhedron, Polytopes and Polygon
Is a topological space considered to be a class in set theory?
Isolated audio without a transformer
Vertical tennis ball into fancy new enumerate
Character is called by their first initial. How do I write it?
Assuring luggage isn't lost with short layover
How could Nomadic scholars effectively memorize libraries worth of information
Aftermath of nuclear disaster at Three Mile Island
Why do all my history books divide Chinese history after the Han dynasty?
Unethical behavior : should I report it?
Trapped in an ocean Temple in Minecraft?
How to apply the changes to my `.zshrc` file after edit?
Is it legal to use cash pulled from a credit card to pay the monthly payment on that credit card?
TSA asking to see cell phone
Am I allowed to use personal conversation as a source?
Is a fighting a fallen friend with the help of a redeemed villain story too much for one book
Wordplay subtraction paradox
Wordplay addition paradoxWhat is a Refreshing Word™?Are you wishful for bees?I'm not a fat henAim the lasers upWord Association GRIDWordplay in an unknown domainInterlaced Word PairsNested word series [humans only]Five Letter Boxed puzzles with special solutionsWordplay addition paradox
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words into which you can insert a chunk, then remove the same consecutive string of letters, and get a different word from the original word?
What the heck am I talking about?!
I have come up with about 11 examples of this strange phenomenon.
(Too easy? Too hard? Try the counterpart addition paradox.)
Afterword:
Here are my 11 examples:
Start with BEECHES --> insert ES --> obtain BESEECHES --> remove ES --> obtain BESEECH
Start with BEING --> insert ING --> obtain BINGEING --> remove ING --> obtain BINGE
Start with CODER --> insert DE --> obtain DECODER --> remove DE --> obtain DECOR
Start with CODERS --> insert DE --> obtain DECODERS --> remove DE --> obtain DECORS
Start with DEDUCT --> insert ED --> obtain DEDUCTED --> remove ED --> obtain DUCTED
Start with DEFEND --> insert DE --> obtain DEFENDED --> remove DE --> obtain FENDED
Start with PALED --> insert ED --> obtain PEDALED --> remove ED --> obtain PEDAL
Start with POSES --> insert SSES --> obtain POSSESSES --> remove SSES --> obtain POSSE
Start with REDESIGN --> insert ED --> obtain REDESIGNED --> remove ED --> obtain RESIGNED
Start with PAIRED --> insert RE --> obtain REPAIRED --> remove RE --> obtain REPAID
Start with DAUNTED --> insert UN --> obtain UNDAUNTED --> remove UN --> obtain UNDATED
wordplay pattern
$endgroup$
add a comment |
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words into which you can insert a chunk, then remove the same consecutive string of letters, and get a different word from the original word?
What the heck am I talking about?!
I have come up with about 11 examples of this strange phenomenon.
(Too easy? Too hard? Try the counterpart addition paradox.)
Afterword:
Here are my 11 examples:
Start with BEECHES --> insert ES --> obtain BESEECHES --> remove ES --> obtain BESEECH
Start with BEING --> insert ING --> obtain BINGEING --> remove ING --> obtain BINGE
Start with CODER --> insert DE --> obtain DECODER --> remove DE --> obtain DECOR
Start with CODERS --> insert DE --> obtain DECODERS --> remove DE --> obtain DECORS
Start with DEDUCT --> insert ED --> obtain DEDUCTED --> remove ED --> obtain DUCTED
Start with DEFEND --> insert DE --> obtain DEFENDED --> remove DE --> obtain FENDED
Start with PALED --> insert ED --> obtain PEDALED --> remove ED --> obtain PEDAL
Start with POSES --> insert SSES --> obtain POSSESSES --> remove SSES --> obtain POSSE
Start with REDESIGN --> insert ED --> obtain REDESIGNED --> remove ED --> obtain RESIGNED
Start with PAIRED --> insert RE --> obtain REPAIRED --> remove RE --> obtain REPAID
Start with DAUNTED --> insert UN --> obtain UNDAUNTED --> remove UN --> obtain UNDATED
wordplay pattern
$endgroup$
add a comment |
$begingroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words into which you can insert a chunk, then remove the same consecutive string of letters, and get a different word from the original word?
What the heck am I talking about?!
I have come up with about 11 examples of this strange phenomenon.
(Too easy? Too hard? Try the counterpart addition paradox.)
Afterword:
Here are my 11 examples:
Start with BEECHES --> insert ES --> obtain BESEECHES --> remove ES --> obtain BESEECH
Start with BEING --> insert ING --> obtain BINGEING --> remove ING --> obtain BINGE
Start with CODER --> insert DE --> obtain DECODER --> remove DE --> obtain DECOR
Start with CODERS --> insert DE --> obtain DECODERS --> remove DE --> obtain DECORS
Start with DEDUCT --> insert ED --> obtain DEDUCTED --> remove ED --> obtain DUCTED
Start with DEFEND --> insert DE --> obtain DEFENDED --> remove DE --> obtain FENDED
Start with PALED --> insert ED --> obtain PEDALED --> remove ED --> obtain PEDAL
Start with POSES --> insert SSES --> obtain POSSESSES --> remove SSES --> obtain POSSE
Start with REDESIGN --> insert ED --> obtain REDESIGNED --> remove ED --> obtain RESIGNED
Start with PAIRED --> insert RE --> obtain REPAIRED --> remove RE --> obtain REPAID
Start with DAUNTED --> insert UN --> obtain UNDAUNTED --> remove UN --> obtain UNDATED
wordplay pattern
$endgroup$
There are words from which you can remove a "chunk", leaving a new word. Like this:
WISHBONE
WI SHBO NE
WI SHBO NE
WI <poof!> NE
WI NE
WI NE
WINE
There are also words that work the other way, for which inserting a "chunk" produces a new word. For example, you can insert the chunk AUTIFI into the word BEER to make BEAUTIFIER.
A "chunk" is a string of consecutive letters. It must consist of at least two letters (no single-letter chunks). It does not need to be a valid English word.
Now, what if I told you there are words into which you can insert a chunk, then remove the same consecutive string of letters, and get a different word from the original word?
What the heck am I talking about?!
I have come up with about 11 examples of this strange phenomenon.
(Too easy? Too hard? Try the counterpart addition paradox.)
Afterword:
Here are my 11 examples:
Start with BEECHES --> insert ES --> obtain BESEECHES --> remove ES --> obtain BESEECH
Start with BEING --> insert ING --> obtain BINGEING --> remove ING --> obtain BINGE
Start with CODER --> insert DE --> obtain DECODER --> remove DE --> obtain DECOR
Start with CODERS --> insert DE --> obtain DECODERS --> remove DE --> obtain DECORS
Start with DEDUCT --> insert ED --> obtain DEDUCTED --> remove ED --> obtain DUCTED
Start with DEFEND --> insert DE --> obtain DEFENDED --> remove DE --> obtain FENDED
Start with PALED --> insert ED --> obtain PEDALED --> remove ED --> obtain PEDAL
Start with POSES --> insert SSES --> obtain POSSESSES --> remove SSES --> obtain POSSE
Start with REDESIGN --> insert ED --> obtain REDESIGNED --> remove ED --> obtain RESIGNED
Start with PAIRED --> insert RE --> obtain REPAIRED --> remove RE --> obtain REPAID
Start with DAUNTED --> insert UN --> obtain UNDAUNTED --> remove UN --> obtain UNDATED
wordplay pattern
wordplay pattern
edited Jul 18 at 13:30
SlowMagic
asked Jul 17 at 14:35
SlowMagicSlowMagic
2,2315 silver badges37 bronze badges
2,2315 silver badges37 bronze badges
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Any word in a pattern so that
you can remove the same chunk from two different places
works as the intermediate word. For example:
RESIGNED→R(ED)ESIGNED→REDESIGN(-ed)
A wordfinder search through Qat is here.
$endgroup$
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
add a comment |
$begingroup$
If the word is [Left][Right] turned [Left][Extra chunk][Right], this chunk must be removed from somewhere else. Let's say it consists of six parts, as in [1][2][[Extra chunk 1][Extra chunk 2]][3][4] (1 or 4 can be empty):
If [[Extra chunk 1][Extra chunk 2]] = [2][Extra chunk 1], it still changes the result as long as [2] != [Extra chunk 2].
If [[Extra chunk 1][Extra chunk 2]] = [Extra chunk 2][3], it still changes the result as long as [3] != [Extra chunk 1].
$endgroup$
add a comment |
$begingroup$
Trainer
Rain
Terrain
Is this the type of thing you're looking for?
$endgroup$
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
add a comment |
Your Answer
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%2f86246%2fwordplay-subtraction-paradox%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Any word in a pattern so that
you can remove the same chunk from two different places
works as the intermediate word. For example:
RESIGNED→R(ED)ESIGNED→REDESIGN(-ed)
A wordfinder search through Qat is here.
$endgroup$
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
add a comment |
$begingroup$
Any word in a pattern so that
you can remove the same chunk from two different places
works as the intermediate word. For example:
RESIGNED→R(ED)ESIGNED→REDESIGN(-ed)
A wordfinder search through Qat is here.
$endgroup$
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
add a comment |
$begingroup$
Any word in a pattern so that
you can remove the same chunk from two different places
works as the intermediate word. For example:
RESIGNED→R(ED)ESIGNED→REDESIGN(-ed)
A wordfinder search through Qat is here.
$endgroup$
Any word in a pattern so that
you can remove the same chunk from two different places
works as the intermediate word. For example:
RESIGNED→R(ED)ESIGNED→REDESIGN(-ed)
A wordfinder search through Qat is here.
answered Jul 17 at 14:58
Deusovi♦Deusovi
70.5k7 gold badges246 silver badges308 bronze badges
70.5k7 gold badges246 silver badges308 bronze badges
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
add a comment |
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
$begingroup$
It seems like you don't even need that, since the intermediate step when the chunk is inserted doesn't seem to have to be a word. For example: rot13(ybtvfg|vp| -> ybt|vp|vfg. Nygubhtu ybtvfg vf abg n jbeq, guvf fgvyy nccrnef gb or inyvq.)
$endgroup$
– Michael Moschella
Jul 17 at 18:18
add a comment |
$begingroup$
If the word is [Left][Right] turned [Left][Extra chunk][Right], this chunk must be removed from somewhere else. Let's say it consists of six parts, as in [1][2][[Extra chunk 1][Extra chunk 2]][3][4] (1 or 4 can be empty):
If [[Extra chunk 1][Extra chunk 2]] = [2][Extra chunk 1], it still changes the result as long as [2] != [Extra chunk 2].
If [[Extra chunk 1][Extra chunk 2]] = [Extra chunk 2][3], it still changes the result as long as [3] != [Extra chunk 1].
$endgroup$
add a comment |
$begingroup$
If the word is [Left][Right] turned [Left][Extra chunk][Right], this chunk must be removed from somewhere else. Let's say it consists of six parts, as in [1][2][[Extra chunk 1][Extra chunk 2]][3][4] (1 or 4 can be empty):
If [[Extra chunk 1][Extra chunk 2]] = [2][Extra chunk 1], it still changes the result as long as [2] != [Extra chunk 2].
If [[Extra chunk 1][Extra chunk 2]] = [Extra chunk 2][3], it still changes the result as long as [3] != [Extra chunk 1].
$endgroup$
add a comment |
$begingroup$
If the word is [Left][Right] turned [Left][Extra chunk][Right], this chunk must be removed from somewhere else. Let's say it consists of six parts, as in [1][2][[Extra chunk 1][Extra chunk 2]][3][4] (1 or 4 can be empty):
If [[Extra chunk 1][Extra chunk 2]] = [2][Extra chunk 1], it still changes the result as long as [2] != [Extra chunk 2].
If [[Extra chunk 1][Extra chunk 2]] = [Extra chunk 2][3], it still changes the result as long as [3] != [Extra chunk 1].
$endgroup$
If the word is [Left][Right] turned [Left][Extra chunk][Right], this chunk must be removed from somewhere else. Let's say it consists of six parts, as in [1][2][[Extra chunk 1][Extra chunk 2]][3][4] (1 or 4 can be empty):
If [[Extra chunk 1][Extra chunk 2]] = [2][Extra chunk 1], it still changes the result as long as [2] != [Extra chunk 2].
If [[Extra chunk 1][Extra chunk 2]] = [Extra chunk 2][3], it still changes the result as long as [3] != [Extra chunk 1].
answered Jul 17 at 20:37
NautilusNautilus
4,3206 silver badges26 bronze badges
4,3206 silver badges26 bronze badges
add a comment |
add a comment |
$begingroup$
Trainer
Rain
Terrain
Is this the type of thing you're looking for?
$endgroup$
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
add a comment |
$begingroup$
Trainer
Rain
Terrain
Is this the type of thing you're looking for?
$endgroup$
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
add a comment |
$begingroup$
Trainer
Rain
Terrain
Is this the type of thing you're looking for?
$endgroup$
Trainer
Rain
Terrain
Is this the type of thing you're looking for?
edited Jul 18 at 11:58
w l
4,14013 silver badges30 bronze badges
4,14013 silver badges30 bronze badges
answered Jul 18 at 10:56
Maze90Maze90
112 bronze badges
112 bronze badges
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
add a comment |
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
The OP wants a generalized pattern.
$endgroup$
– Nautilus
Jul 18 at 12:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
$begingroup$
Ah that's a shame. Was fun to come up with that one anyway @Nautilus
$endgroup$
– Maze90
Jul 18 at 13:11
add a comment |
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%2f86246%2fwordplay-subtraction-paradox%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