3.2 Word Building, Hidden Words & Compound Words

3.2 Word Building, Hidden Words & Compound Words

Structural verbal reasoning tests a student's spatial-verbal awareness, orthographic mapping, and vocabulary construction skills. Unlike semantic VR (which deals with word meanings), structural VR focuses on how letters combine, divide, and bridge word boundaries.

1. Hidden Words in Sentences

Hidden word questions require students to find a single four-letter word hidden continuously across two adjacent words in a sentence.

Key Rules for Hidden Words

• The hidden word must bridge two adjacent words (taking 1 to 3 letters from the end of the first word and 3 to 1 letters from the start of the second word).
• The letters must appear in exact sequential order without skipping or rearranging.
• Punctuation (commas, full stops) is ignored.
• The hidden word cannot be contained entirely within a single word.

Boundary Scanning Technique

Instead of reading the sentence normally for meaning, train your eyes to scan word boundaries:

$\text{Word 1 Split} + \text{Word 2 Split} = \text{4-Letter Word}$

Worked Example: Boundary Extraction

Sentence: "The giant fish ate the sweet bread on the dock."

• Scan boundary 1 (The + giant): e + gia $\rightarrow$ egia (invalid).
• Scan boundary 2 (giant + fish): t + fis $\rightarrow$ tfis (invalid); nt + fi $\rightarrow$ ntfi (invalid).
• Scan boundary 3 (fish + ate): h (from fish) + ate (from ate) $\rightarrow$ HATE.
• Result: The 4-letter hidden word is HATE.

---

2. Compound Word Construction

Compound word questions present two sets of words: Set A: [ PAN , FOOT , RAIN ]
Set B: [ BOW , PRINT , CAKE ]

You must pick one word from Set A and one word from Set B that join together to form a recognized single compound word.

Rule Matrix for Compound Words

1. Order Matters: The word from Set A always forms the prefix (first part), and the word from Set B forms the suffix (second part).
2. Single Recognized Word: The resulting word must be written as a single word without spaces or hyphens in standard English dictionaries (e.g., FOOTPRINT, RAINBOW, PANCAKE).
3. Semantic Verification: Verify that the compound word matches any definition specified in the prompt.

Worked Example: Select one word from Set A [ SEA , WOOD , HAND ] and one word from Set B [ CUT , BAG , SHORE ] to match the clue: "A coastal land border."

• Test combinations: SEACUT (no), SEABAG (no), SEASHORE (YES!).
• Resulting compound word: SEASHORE (SEA + SHORE).

---

3. Single Letter Transfer Mechanics

Letter transfer questions ask you to move one single letter from the first word to the second word, transforming both into new, valid words.

Word 1: SMART   ---> (Move 'S') --->  Word 1 New: MART
Word 2: LATE    + 'S'           --->  Word 2 New: SLATE

Step-by-Step Solving Algorithm

1. Analyze Word 1: Test removing each letter one by one. Check if the remaining letters spell a real English word.
   • Remove S from SMART $\rightarrow$ MART (Valid word!)
   • Remove M from SMART $ ightarrow$ SART (Invalid)
   • Remove R from SMART $ ightarrow$ SMAT (Invalid)
   • Remove T from SMART $ ightarrow$ SMAR (Invalid)
2. Analyze Insertion into Word 2: Take the isolated candidate letter (S) and test inserting it into every possible slot in Word 2 (LATE):
   • S + LATE $\rightarrow$ SLATE (Valid word!)
   • L + S + ATE $ ightarrow$ LSATE (Invalid)
   • LAT + S + E $ ightarrow$ LATSE (Invalid)
   • LATE + S $\rightarrow$ LATES (Valid plural, but SLATE is the root noun).
3. Verify: Both MART and SLATE are standard dictionary words. Transferred letter: S.

---

4. Anagram Puzzles & Letter Deduction

Anagram questions in the 11+ require unscrambling a set of letters to solve a clue, or subtracting a smaller word's letters from a larger jumble.

Letter Elimination Strategy

When given a large anagram minus a known word:

1. Write down the letter count of the source string.
2. Cross off each letter of the target word one by one.
3. Group the remaining letters into vowel/consonant pairs to quickly recognize common roots (TH-, CH-, -ER, -ING, -ED).

Worked Example: Anagram Subtraction

Question: Remove the letters of the word LEAP from the anagram ELEPHANT. Unscramble the remaining letters to form a valid 4-letter word.

• Source String: E, L, E, P, H, A, N, T (8 letters)
• Remove L-E-A-P:
  • Cross out L $\rightarrow$ E, E, P, H, A, N, T
  • Cross out E $\rightarrow$ E, P, H, A, N, T
  • Cross out A $\rightarrow$ E, P, H, N, T
  • Cross out P $\rightarrow$ E, H, N, T
• Remaining letters: E, H, N, T
• Unscramble: THEN. Valid word: THEN.