Study Notes – Para Jumbles
(Advanced MIT‑style treatment for IBPS SO English)
Para jumble is a type of passage‑construction question that tests a student’s ability to understand logical flow, grammatical coherence, and contextual clues.
You are given 8–10 independent statements and asked to arrange them into a single, coherent paragraph.
These notes will treat the problem from first principles, show how to formalise it, analyse its theoretical underpinnings, and give you a step‑by‑step algorithm that you can implement mentally in an exam setting.
1. What Is a Para Jumble?
| Feature | Detail |
|---|---|
| Input | 8–10 short statements (≈ 25–40 words each). |
| Output | A single paragraph where statements appear in a logical order. |
| Skills tested | • Logical sequencing • Grammatical cohesion (pronoun reference, tense consistency) • Contextual inference (cause‑effect, time, location) • Attention to detail (transition words, conjunctions) |
2. Formal Representation
We can model the problem as a partial order over a set of statements.
| Symbol | Meaning |
|---|---|
| (S = {s_1,\dots,s_n}) | Set of statements |
| (R \subseteq S \times S) | “(s_i) must precede (s_j)” relation |
| (P = (S,R)) | Partially ordered set (poset) |
2.1 Building the Relation (R)
-
Explicit cues
- Time words: before, after, later, earlier
- Transition words: however, therefore, consequently
- Pronouns: he, she, it → refer to the subject in the previous sentence.
-
Implicit cues
- Logical sequence: e.g., “We first do X, then do Y”
- Causal chain: “Because X, Y happened”.
- Tense consistency: Past → past → past, etc.
-
Rule extraction
if s_i contains "before s_j" or "after s_j" → add (s_i,s_j) or (s_j,s_i) if s_i ends with "and" or "but" and the next sentence starts with a related phrase → add (s_i,s_next) if s_i refers to a pronoun that refers to subject in s_k (k<i) → add (s_k,s_i)
3. Theoretical Foundations
3.1 Partial Orders and Linear Extensions
- Partial order: reflexive, antisymmetric, transitive.
- Linear extension: a total order consistent with the partial order.
- Dilworth’s theorem: maximum number of pair‑wise incomparable elements equals minimum number of chains that cover the poset.
- Number of linear extensions: can be huge, but we only need one that is semantically natural.
3.2 Complexity
- Topological sorting on a DAG is (O(n+e)).
- The jumbled‑statements graph is always a DAG (no cycles by construction).
- NP‑hardness only arises if we impose additional scoring (e.g., maximize coherence score), which is unnecessary for the exam.
3.3 Edge Cases
| Edge Case | Why it matters | Strategy |
|---|---|---|
| Independent statements | Multiple valid orders; must pick the most natural. | Use semantic cohesion (topic continuity). |
| Contradictory statements | Inconsistent facts → no valid order. | Spot contradictions early; the correct answer will avoid them. |