Skip to main content
. 2020 Aug 1;4:57–70. doi: 10.1162/opmi_a_00034

Table 5. .

Grammar for English (recursive) numeral system for the range 1–100.

Number Rule Complexity
1 ‘one’ =d 1 3
2 ‘two’ =d 2 3
3 ‘three’ =d 3 3
4 ‘four’ =d s (‘three’) 4
5 ‘five’ =d s (‘four’) 4
6 ‘six’ =d s (‘five’) 4
7 ‘seven’ =d s (‘six’) 4
8 ‘eight’ =d s (‘seven’) 4
9 ‘nine’ =d s (‘eight’) 4
10 ‘ten’ =d s(‘nine’) 4
11 ‘eleven’ =d s (‘ten’) 4
12 ‘twelve’ =d s (‘eleven’) 4
13…19 u‘teen’ =d m (u) + m (‘ten’) 8
20…90 u‘ty’ =d m (u) × m (‘ten’) 8
21…99 u‘ty’-v =d m (u) × m (‘ten’) + m (v) 13
100 ‘hundred’ =d p (m (‘ten’), m (‘two’)) 7
u ∈ {‘twen’, ‘thir’, …, ‘eigh’, ‘nine’} 10
v ∈ {‘one’, ‘two’, …, ‘eight’, ‘nine’} 11
‘twen’ ≡ ‘two’ 3
‘thir’ ≡ ‘three’ 3
‘for’ ≡ ‘four’ 3
‘fif’ ≡ ‘five’ 3
‘eigh’ ≡ ‘eight’ 3
    Σ = 117

Note. Each rule is composed of symbols, and each symbol adds a unit complexity of 1.