ReasoningAbility.com

Word Formation - Intermediate Level: compound words INTERMEDIATE

Level up your word formation skills with this comprehensive review. 20 intermediate-level problems await in Worksheet 14 of 30. Focus area: compound words. Learn anagram solving, dictionary words, word length patterns through systematic practice. Designed for mid-level learners seeking moderate complexity with mixed patterns.

📝 Worksheet 14 of 30 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Intermediate level

What you'll learn in this worksheet:
Your progress through Word Formation
Worksheet 14 of 30 (46% complete)

Question 1

Which of the following words CANNOT be formed from the letters of the word 'BEAUTIFUL'?
The word 'BEAUTY' cannot be formed from 'BEAUTIFUL' because: BEAUTY requires the letter 'Y' but 'BEAUTIFUL' has no 'Y' The other words ['FAULT', 'TABLE', 'TUBE'] can all be formed using available letters.
odd-one-out, letter-availability, vocabulary

Question 2

Which word can be formed using the letters: E, N, P?
From the letters E, N, P, we can form 'PEN'. Other possible combinations include: NEP.
formation, basic, selection

Question 3

Which word can be formed by rearranging the letters: RNEEG?
Analyzing the letters RNEEG: We have 5 letters. Rearranging systematically, we get 'GREEN', which is a valid English word.
jumbled, 5-letter, intermediate

Question 4

If each letter in the word 'WORLD' is shifted forward by 3 position(s) in the alphabet, what is the resulting word?
Forward 3: W→Z, O→R, R→U, L→O, D→G
coding-decoding, alphabet-shift, pattern, intermediate

Question 5

Which word can be formed using letters from the word 'STEAM'?
From 'STEAM', we can extract the letters to form 'TEA'. The letters T, E, A are all present in the original word.
extraction, basic

Question 6

What word is formed by adding the prefix 'UN' to 'happy'?
Adding the prefix 'UN' to the root word 'happy' forms 'unhappy'. This follows standard English word formation rules.
morphology, affixes, basic

Question 7

Form a word related to 'ANIMAL' using the letters: L, I, O, N
The category is 'ANIMAL' and from letters L, I, O, N, we can form 'LION', which is a valid animal.
category, themed, vocabulary

Question 8

How many distinct 5-letter words can be formed using all letters from: T, O, N, E, S (each letter used exactly once)?
From T, O, N, E, S, we can form exactly 3 valid 5-letter words: STONE, NOTES, ONSET. Strategy: Generate permutations systematically and check against dictionary.
counting, permutation, advanced

Question 9

Form a word related to 'COLOR' using the letters: G, R, E, E, N
The category is 'COLOR' and from letters G, R, E, E, N, we can form 'GREEN', which is a valid color.
category, themed, vocabulary

Question 10

Rearrange the letters 'OGD' to form a meaningful English word.
The letters OGD can be rearranged to form 'DOG'. This is a common 3-letter English word.
jumbled, basic, 3-letter

Question 11

Which word can be formed using letters from the word 'CHAIR'?
From 'CHAIR', we can extract the letters to form 'HAIR'. The letters H, A, I, R are all present in the original word.
extraction, basic

Question 12

How many distinct 5-letter words can be formed using all letters from: L, A, T, E, S (each letter used exactly once)?
From L, A, T, E, S, we can form exactly 3 valid 5-letter words: SLATE, STEAL, TALES. Strategy: Generate permutations systematically and check against dictionary.
counting, permutation, advanced

Question 13

Unscramble the letters 'ONITLUSO' to form a meaningful word commonly used in competitive exams.
Breaking down ONITLUSO: With 8 letters, we need to identify common letter patterns. The word 'SOLUTION' uses all letters exactly once. Strategy: Look for common prefixes (in-, re-, pre-) and suffixes (-tion, -ate, -ing).
jumbled, 8-letter, advanced

Question 14

By removing exactly ONE letter from 'STARTS', which of the following words can be formed?
Removing the letter 'set()' from 'STARTS' forms 'START'. Remove 'S' at end.
word-reduction, deletion, vocabulary

Question 15

Which word can be formed by rearranging the letters: OWTER?
Analyzing the letters OWTER: We have 5 letters. Rearranging systematically, we get 'TOWER', which is a valid English word.
jumbled, 5-letter, intermediate

Question 16

How many distinct 5-letter words can be formed using all letters from: L, A, T, E, S (each letter used exactly once)?
From L, A, T, E, S, we can form exactly 3 valid 5-letter words: SLATE, STEAL, TALES. Strategy: Generate permutations systematically and check against dictionary.
counting, permutation, advanced

Question 17

Which word can be formed by rearranging the letters: ERBKA?
Analyzing the letters ERBKA: We have 5 letters. Rearranging systematically, we get 'BRAKE', which is a valid English word.
jumbled, 5-letter, intermediate

Question 18

From the letter grid below, find a valid word by moving to adjacent cells (horizontal, vertical, or diagonal): B R A E A K D O G
In the grid, 'BREAK' can be formed by tracing adjacent cells. Strategy: Start from each letter and explore all possible paths to form valid words.
grid, spatial, pattern-matching

Question 19

Find a word that starts with 'I', ends with 'T', uses: M, P, O, R, T, A, N.
Given the constraints, 'IMPORTANT' satisfies all conditions: uses the specified letters, starts and ends with the required letters, and forms a valid English word.
constraints, logic, advanced

Question 20

What is the longest valid English word that can be formed using the letters: C, O, M, P, U, T, E, R (each letter used at most once)?
Analyzing C, O, M, P, U, T, E, R: The longest word is 'COMPUTER' with 8 letters. Strategy: Start with longer patterns, check for common words, then eliminate impossible combinations.
optimization, advanced, vocabulary
Previous Worksheet Next Worksheet