Say regex, lookahead, greedy, quantifier, and backreference correctly — the pattern-matching vocabulary every developer needs to know.
0 / 5 completed
1 / 5
How is 'regex' pronounced?
Regex is pronounced /ˈrɛdʒɛks/ — 'REJ-eks'. The name is a shortening of 'regular expression'. 'Reg' = /rɛdʒ/ — short /ɛ/ as in 'bed', followed by the soft /dʒ/ as in 'gem', 'page'. '-ex' = /ɛks/. Two syllables: REJ-eks, stress on the first. 'Regexp' is an alternative abbreviation, also pronounced similarly as 'REJ-exp'. Regex is a sequence of characters defining a search pattern, used for string matching and manipulation in virtually every programming language. Key metacharacters include `.`, `*`, `+`, `?`, `[]`, `^`, and `$`.
2 / 5
How is 'lookahead' pronounced?
Lookahead is pronounced /ˈlʊkəhɛd/ — 'LOOK-uh-hed'. It is a compound of 'look' + 'ahead'. 'Look' = /lʊk/ (short /ʊ/ as in 'book', 'good'). 'a' = /ə/ (schwa). 'head' = /hɛd/ (short /ɛ/). Three syllables: LOOK-uh-hed, stress on the first. In regex, a lookahead is a zero-width assertion that matches a position followed by a specific pattern. A positive lookahead `(?=...)` asserts 'what follows matches X'; a negative lookahead `(?!...)` asserts 'what follows does not match X'.
3 / 5
How is 'greedy' pronounced in a regex context?
Greedy is pronounced /ˈɡriːdi/ — 'GREE-dee'. It is the common English adjective meaning excessively desirous, perfectly describing a greedy quantifier's behaviour. 'Gree' = /ɡriː/ (long 'ee'). '-dy' = /di/. Two syllables: GREE-dee, stress on the first. In regex, a greedy quantifier (like `*`, `+`, `?`) matches as many characters as possible while still allowing the overall pattern to match. The opposite is 'lazy' (non-greedy), achieved by appending `?` (e.g., `*?`, `+?`).
4 / 5
How is 'quantifier' pronounced?
Quantifier is pronounced /ˈkwɒntɪfaɪər/ — 'KWON-tih-fy-ur'. The word comes from 'quantify' + the agent suffix '-er'. 'Quan' = /kwɒn/ (the /kw/ cluster + short /ɒ/). 'ti' = /tɪ/. 'fi' = /faɪ/ (the diphthong as in 'fly'). '-er' = /ər/ (schwa). Four syllables: KWON-tih-fy-ur, stress on the first. In regex, a quantifier specifies how many times the preceding element can match: `*` (zero or more), `+` (one or more), `?` (zero or one), `{n}` (exactly n), `{n,m}` (between n and m times).
5 / 5
How is 'backreference' pronounced?
Backreference is pronounced /ˈbækrɛfrəns/ — 'BAK-ref-runss'. It is a compound of 'back' + 'reference'. 'Back' = /bæk/ (short /æ/). 'ref' = /rɛf/ (short /ɛ/). '-rence' = /rəns/ (schwa + /ns/). Three syllables: BAK-ref-runss, stress on the first. In regex, a backreference allows you to reuse a previously captured group within the same pattern. For example, `(\w+)\s\1` matches a word followed by a space followed by the same word again, using `\1` to reference the first capture group.