t9_map = '2':'abc', '3':'def', ... def word_to_t9(word): return ''.join(str(k) for ch in word.lower() for k,v in t9_map.items() if ch in v) dictionary = ["case", "base", "bard"] t9_index = {} for w in dictionary: code = word_to_t9(w) t9_index.setdefault(code, []).append(w)
1. Executive Summary A T9 Solver is a program or algorithm designed to reverse-engineer the T9 (Text on 9 keys) predictive text system. Given a numeric keypad sequence (e.g., 2273 ), the solver returns the possible original word(s) by mapping the numbers to letters on a traditional phone keypad. This report explores the underlying mechanics of T9, the structure of an efficient solver, its algorithmic approaches, and practical applications. 2. Background: How T9 Works T9 was a predictive text technology popular on mobile phones (late 1990s–2000s) that allowed users to type words by pressing each key once per letter, rather than multiple times. The standard keypad mapping is: t9 solver
Memory efficient for shared prefixes; supports autocomplete-style solving. 4.3. Reverse Lookup from Number to Words Directly from a phone number to possible words (as in "phonewords" for vanity numbers). t9_map = '2':'abc', '3':'def',
| Key | Letters | |-----|---------| | 2 | ABC | | 3 | DEF | | 4 | GHI | | 5 | JKL | | 6 | MNO | | 7 | PQRS | | 8 | TUV | | 9 | WXYZ | Given a numeric keypad sequence (e
E.g., 1-800-FLOWERS → 1-800-3569377 . A T9 solver would reverse 3569377 to possible letter sequences. | Factor | Consideration | |--------|----------------| | Dictionary size | Large dictionaries (e.g., 100k+ words) need efficient indexing. | | Ambiguity | Many numbers map to multiple words; solver must return all. | | Case sensitivity | Usually case-insensitive; all uppercase/ lowercase. | | Non-letters | Apostrophes (e.g., "don't") → map only letters; ignore or skip others. | | Speed | For real-time, hash map is best. For memory-limited, trie or sorted list + binary search. | 6. Sample Use Case: Solving a T9 Puzzle Input: 43556
solver = lambda digits: t9_index.get(digits, []) A trie (prefix tree) allows incremental solving and supports wildcard or partial queries.