ece59500nl/top_down_partially_evaluated_recognizer.py at main · qobi/ece59500nl · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
import argparse
parser = argparse.ArgumentParser(description = "Template")
parser.add_argument("-d",
                    default=False,
                    action="store_true")
parser.add_argument("-m",
                    default=False,
                    action="store_true")
options = parser.parse_args()

debug = options.d
memoized = options.m

def top_down_s(words):
    if debug:
        print((words, "s"))
    n = len(words)
    if n!=1:
        for k in range(1, n):
            if (top_down_np(words[0:k]) and
                top_down_vp(words[k:n])):
                return True
    return False

def top_down_np(words):
    if debug:
        print((words, "np"))
    n = len(words)
    if n!=1:
        for k in range(1, n):
            if (top_down_d(words[0:k]) and
                top_down_nb(words[k:n])):
                return True
            if (top_down_d(words[0:k]) and
                top_down_n(words[k:n])):
                return True
    return False

def top_down_nb(words):
    if debug:
        print((words, "nb"))
    n = len(words)
    if n!=1:
        for k in range(1, n):
            if (top_down_a(words[0:k]) and
                top_down_nb(words[k:n])):
                return True
            if (top_down_a(words[0:k]) and
                top_down_n(words[k:n])):
                return True
            if (top_down_nb(words[0:k]) and
                top_down_pp(words[k:n])):
                return True
            if (top_down_n(words[0:k]) and
                top_down_pp(words[k:n])):
                return True
    return False

def top_down_pp(words):
    if debug:
        print((words, "pp"))
    n = len(words)
    if n!=1:
        for k in range(1, n):
            if (top_down_p(words[0:k]) and
                top_down_np(words[k:n])):
                return True
    return False

def top_down_vp(words):
    if debug:
        print((words, "vp"))
    n = len(words)
    if n!=1:
        for k in range(1, n):
            if (top_down_v(words[0:k]) and
                top_down_np(words[k:n])):
                return True
            if (top_down_v(words[0:k]) and
                top_down_pp(words[k:n])):
                return True
    return False

def top_down_n(words):
    if debug:
        print((words, "n"))
    n = len(words)
    if n==1:
        if (words[0]=="square" or
            words[0]=="piece" or
            words[0]=="pawn" or
            words[0]=="bishop" or
            words[0]=="knight" or
            words[0]=="rook" or
            words[0]=="queen" or
            words[0]=="king" or
            words[0]=="rank" or
            words[0]=="file" or
            words[0]=="edge" or
            words[0]=="corner"):
            return True
    return False

def top_down_a(words):
    if debug:
        print((words, "a"))
    n = len(words)
    if n==1:
        if (words[0]=="black" or words[0]=="white"):
            return True
    return False

def top_down_d(words):
    if debug:
        print((words, "d"))
    n = len(words)
    if n==1:
        if (words[0]=="every" or words[0]=="some" or words[0]=="the"):
            return True
    return False

def top_down_v(words):
    if debug:
        print((words, "v"))
    n = len(words)
    if n==1:
        if (words[0]=="is"):
            return True
    return False

def top_down_p(words):
    if debug:
        print((words, "p"))
    n = len(words)
    if n==1:
        if (words[0]=="of" or words[0]=="on"):
            return True
    return False

def memoize(f):
    chart = {}
    def internal(x):
        if x in chart:
            return chart[x]
        else:
            result = f(x)
            chart[x] = result
            return result
    return internal

if memoized:
    top_down_s = memoize(top_down_s)
    top_down_np = memoize(top_down_np)
    top_down_nb = memoize(top_down_nb)
    top_down_pp = memoize(top_down_pp)
    top_down_vp = memoize(top_down_vp)
    top_down_n = memoize(top_down_n)
    top_down_a = memoize(top_down_a)
    top_down_d = memoize(top_down_d)
    top_down_v = memoize(top_down_v)
    top_down_p = memoize(top_down_p)

print(top_down_s(("some", "pawn", "is", "on", "some", "square")))

print(top_down_s(("some", "pawn", "is", "on", "some")))

print(top_down_s(("some", "pawn", "is", "on", "some", "square", "square")))