New-Pattern Sentence Coding

New-pattern coding, often called Chinese coding or sentence coding, gives you three or four coded sentences and asks you to find the code for one word or to decode a symbol. There is no letter-position maths here; it is pure logic of matching. This format now dominates SBI Clerk over the old single-word codes, so the common-word method that cracks it deserves careful practice. Done right, a whole set of four or five questions falls out of one round of comparison.

How Sentence Coding Works

Each statement pairs a set of real words with a set of code words, but not in order — the codes are scrambled. You are never told which code means which word directly; you deduce it by comparing statements that share a word. Because the mapping is one code per word throughout the set, a single confirmed pairing stays true across every statement. Your job is to line the statements up, spot the overlaps, and let the shared words reveal their codes one by one until the target word is pinned down.

The Common-Word Method

Take two statements that share exactly one common word. Whatever code word appears in both statements must stand for that shared word — nothing else is common, so nothing else can match. Circle that pairing and carry it forward. Repeat with other pairs of statements to lock more words. This overlap technique is the entire engine of sentence coding: you are not translating, you are intersecting sets of words and codes to find what they must have in common.

Two statements share one word → the one shared code = that word's code

Working an Example Set

Suppose 'ma pa' means 'fresh fruit', 'pa ta' means 'fruit basket', and 'ta na' means 'basket weave'. The first two share 'fruit' and share the code 'pa', so pa = fruit. The middle two share 'basket' and share 'ta', so ta = basket. Back-substitute: in 'ma pa', pa is fruit, so ma = fresh. In 'ta na', ta is basket, so na = weave. Every word is now decoded from three short lines using only overlaps.

Handling No-Common-Word Traps

Sometimes two statements share a word but also share more than one code, so you cannot pin the pairing from that pair alone. Do not force it — move to a different pair of statements where the overlap is cleaner, confirm a code there, then return with that knowledge to break the ambiguous pair. The setter's trap is to make you guess from an unclear overlap; the discipline is to only accept a pairing when it is the sole possible match, and to build outward from the certain pairings rather than the doubtful ones.

Solved Example

Example: 'sa re ga' is 'birds fly high', 'ga ni sa' is 'birds sing sweet'. The two share 'birds' and share codes 'sa' and 'ga', so together they only tell us {sa, ga} = {birds, high or sing}. To fix 'birds', you need a third statement sharing just one of them. The answer for 'birds' waits until a clean single overlap appears — never guess from a double overlap.

✗ Guessing a code from statements sharing two words  |  ✓ Using only pairs that share exactly one word