Nested word series [humans only]












0












$begingroup$


[This is just a fun little puzzle for humans. We'll see you next time, computers!]




It's interesting to think about words contained in other words. How often do we notice, for example, that VOLCANOES contains the word CANOES, or that CONCERNS contains the word ONCE?



But why stop there? We can find words within words within words, nested like Russian dolls.



The most impressive nested series I've found are 9 levels, like this:



REARRANGEMENTS
ARRANGEMENTS
ARRANGEMENT
ARRANGE
RANGE
RANG
RAN
AN
A


But why be content with contiguous letters only? How about nested words in which the letters selected are not contiguous in the parent?



For example, REPUDIATE contains the word EDIT, only that the letters E-D-I-T are not necessarily contiguous.



(However, they must be in the same order in the child word as they are in the parent word.)



Here's how a nested series with noncontinuous letters might look. The starting word is NONREPRESENTATIONAL:



NONREPRESENTATIONAL
REPRESENTATIONAL
REPRESENTATION
PRESENTATION
S TATION
S TAT IN
S TA IN
S IN
IN
I

I.e., NONREPRESENTATIONAL, REPRESENTATIONAL, REPRESENTATION, PRESENTATION, STATION, STATIN, STAIN, SIN, IN, I






In each case below, I have given you the starting word. See if you can find the indicated number of nested levels.




  1. Start with TRANSCENDENTALISTS and see if you can find 9 more nested levels


  2. Start with INTERRELATIONSHIPS and see if you can find 9 more nested levels


  3. Start with SLAUGHTERHOUSES and see if you can find 9 more nested levels


  4. Start with STARTLINGLY and see if you can find 9 more nested levels


  5. Start with INTEGRATIONISTS and see if you can find 9 more nested levels


  6. Start with NONCONFRONTATIONAL and see if you can find 9 more nested levels


  7. Start with NONDENOMINATIONAL and see if you can find 9 more nested levels


  8. Start with DECONSTRUCTIONISTS and see if you can find 9 more nested levels


  9. Start with CRAFTSPERSONS and see if you can find 9 more nested levels


  10. Start with CONTRAINDICATIONS and see if you can find 9 more nested levels


  11. Start with RESTORATIONISTS and see if you can find 10 more nested levels


  12. Start with UNCHARACTERISTICALLY and see if you can find 10 more nested levels










share









$endgroup$

















    0












    $begingroup$


    [This is just a fun little puzzle for humans. We'll see you next time, computers!]




    It's interesting to think about words contained in other words. How often do we notice, for example, that VOLCANOES contains the word CANOES, or that CONCERNS contains the word ONCE?



    But why stop there? We can find words within words within words, nested like Russian dolls.



    The most impressive nested series I've found are 9 levels, like this:



    REARRANGEMENTS
    ARRANGEMENTS
    ARRANGEMENT
    ARRANGE
    RANGE
    RANG
    RAN
    AN
    A


    But why be content with contiguous letters only? How about nested words in which the letters selected are not contiguous in the parent?



    For example, REPUDIATE contains the word EDIT, only that the letters E-D-I-T are not necessarily contiguous.



    (However, they must be in the same order in the child word as they are in the parent word.)



    Here's how a nested series with noncontinuous letters might look. The starting word is NONREPRESENTATIONAL:



    NONREPRESENTATIONAL
    REPRESENTATIONAL
    REPRESENTATION
    PRESENTATION
    S TATION
    S TAT IN
    S TA IN
    S IN
    IN
    I

    I.e., NONREPRESENTATIONAL, REPRESENTATIONAL, REPRESENTATION, PRESENTATION, STATION, STATIN, STAIN, SIN, IN, I






    In each case below, I have given you the starting word. See if you can find the indicated number of nested levels.




    1. Start with TRANSCENDENTALISTS and see if you can find 9 more nested levels


    2. Start with INTERRELATIONSHIPS and see if you can find 9 more nested levels


    3. Start with SLAUGHTERHOUSES and see if you can find 9 more nested levels


    4. Start with STARTLINGLY and see if you can find 9 more nested levels


    5. Start with INTEGRATIONISTS and see if you can find 9 more nested levels


    6. Start with NONCONFRONTATIONAL and see if you can find 9 more nested levels


    7. Start with NONDENOMINATIONAL and see if you can find 9 more nested levels


    8. Start with DECONSTRUCTIONISTS and see if you can find 9 more nested levels


    9. Start with CRAFTSPERSONS and see if you can find 9 more nested levels


    10. Start with CONTRAINDICATIONS and see if you can find 9 more nested levels


    11. Start with RESTORATIONISTS and see if you can find 10 more nested levels


    12. Start with UNCHARACTERISTICALLY and see if you can find 10 more nested levels










    share









    $endgroup$















      0












      0








      0





      $begingroup$


      [This is just a fun little puzzle for humans. We'll see you next time, computers!]




      It's interesting to think about words contained in other words. How often do we notice, for example, that VOLCANOES contains the word CANOES, or that CONCERNS contains the word ONCE?



      But why stop there? We can find words within words within words, nested like Russian dolls.



      The most impressive nested series I've found are 9 levels, like this:



      REARRANGEMENTS
      ARRANGEMENTS
      ARRANGEMENT
      ARRANGE
      RANGE
      RANG
      RAN
      AN
      A


      But why be content with contiguous letters only? How about nested words in which the letters selected are not contiguous in the parent?



      For example, REPUDIATE contains the word EDIT, only that the letters E-D-I-T are not necessarily contiguous.



      (However, they must be in the same order in the child word as they are in the parent word.)



      Here's how a nested series with noncontinuous letters might look. The starting word is NONREPRESENTATIONAL:



      NONREPRESENTATIONAL
      REPRESENTATIONAL
      REPRESENTATION
      PRESENTATION
      S TATION
      S TAT IN
      S TA IN
      S IN
      IN
      I

      I.e., NONREPRESENTATIONAL, REPRESENTATIONAL, REPRESENTATION, PRESENTATION, STATION, STATIN, STAIN, SIN, IN, I






      In each case below, I have given you the starting word. See if you can find the indicated number of nested levels.




      1. Start with TRANSCENDENTALISTS and see if you can find 9 more nested levels


      2. Start with INTERRELATIONSHIPS and see if you can find 9 more nested levels


      3. Start with SLAUGHTERHOUSES and see if you can find 9 more nested levels


      4. Start with STARTLINGLY and see if you can find 9 more nested levels


      5. Start with INTEGRATIONISTS and see if you can find 9 more nested levels


      6. Start with NONCONFRONTATIONAL and see if you can find 9 more nested levels


      7. Start with NONDENOMINATIONAL and see if you can find 9 more nested levels


      8. Start with DECONSTRUCTIONISTS and see if you can find 9 more nested levels


      9. Start with CRAFTSPERSONS and see if you can find 9 more nested levels


      10. Start with CONTRAINDICATIONS and see if you can find 9 more nested levels


      11. Start with RESTORATIONISTS and see if you can find 10 more nested levels


      12. Start with UNCHARACTERISTICALLY and see if you can find 10 more nested levels










      share









      $endgroup$




      [This is just a fun little puzzle for humans. We'll see you next time, computers!]




      It's interesting to think about words contained in other words. How often do we notice, for example, that VOLCANOES contains the word CANOES, or that CONCERNS contains the word ONCE?



      But why stop there? We can find words within words within words, nested like Russian dolls.



      The most impressive nested series I've found are 9 levels, like this:



      REARRANGEMENTS
      ARRANGEMENTS
      ARRANGEMENT
      ARRANGE
      RANGE
      RANG
      RAN
      AN
      A


      But why be content with contiguous letters only? How about nested words in which the letters selected are not contiguous in the parent?



      For example, REPUDIATE contains the word EDIT, only that the letters E-D-I-T are not necessarily contiguous.



      (However, they must be in the same order in the child word as they are in the parent word.)



      Here's how a nested series with noncontinuous letters might look. The starting word is NONREPRESENTATIONAL:



      NONREPRESENTATIONAL
      REPRESENTATIONAL
      REPRESENTATION
      PRESENTATION
      S TATION
      S TAT IN
      S TA IN
      S IN
      IN
      I

      I.e., NONREPRESENTATIONAL, REPRESENTATIONAL, REPRESENTATION, PRESENTATION, STATION, STATIN, STAIN, SIN, IN, I






      In each case below, I have given you the starting word. See if you can find the indicated number of nested levels.




      1. Start with TRANSCENDENTALISTS and see if you can find 9 more nested levels


      2. Start with INTERRELATIONSHIPS and see if you can find 9 more nested levels


      3. Start with SLAUGHTERHOUSES and see if you can find 9 more nested levels


      4. Start with STARTLINGLY and see if you can find 9 more nested levels


      5. Start with INTEGRATIONISTS and see if you can find 9 more nested levels


      6. Start with NONCONFRONTATIONAL and see if you can find 9 more nested levels


      7. Start with NONDENOMINATIONAL and see if you can find 9 more nested levels


      8. Start with DECONSTRUCTIONISTS and see if you can find 9 more nested levels


      9. Start with CRAFTSPERSONS and see if you can find 9 more nested levels


      10. Start with CONTRAINDICATIONS and see if you can find 9 more nested levels


      11. Start with RESTORATIONISTS and see if you can find 10 more nested levels


      12. Start with UNCHARACTERISTICALLY and see if you can find 10 more nested levels








      wordplay no-computers





      share












      share










      share



      share










      asked 1 min ago









      SlowMagicSlowMagic

      4017




      4017






















          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
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80045%2fnested-word-series-humans-only%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
















          draft saved

          draft discarded




















































          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.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f80045%2fnested-word-series-humans-only%23new-answer', 'question_page');
          }
          );

          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







          Popular posts from this blog

          What are all the squawk codes?

          What are differences between VBoxVGA, VMSVGA and VBoxSVGA in VirtualBox?

          Hudsonelva