quadrivium/index.html at main · standardgalactic/quadrivium · 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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Quadrivium - Interactive Parsing Tree Visualizer</title>
    <style>
        body, html {
            height: 100%;
            margin: 0;
            font-family: Arial, sans-serif;
            background-color: #f4f4f4;
            display: flex;
            justify-content: center;
            align-items: center;
            flex-direction: column;
        }

        #container {
            width: 80vw;
            height: 80vh;
            background: white;
            border: 2px solid #333;
            border-radius: 8px;
            padding: 20px;
            box-shadow: 0 0 10px rgba(0, 0, 0, 0.1);
            display: flex;
            flex-direction: column;
            align-items: center;
            overflow: auto; /* Enable scrollbars */
        }

        #title {
            font-size: 1.5em;
            margin-bottom: 20px;
        }

        #input-section {
            margin-bottom: 20px;
            display: flex;
            gap: 10px;
        }

        #sentence-input {
            padding: 10px;
            flex-grow: 1;
            border: 1px solid #ccc;
            border-radius: 4px;
        }

        #visualize-btn {
            padding: 10px 20px;
            background: #333;
            color: white;
            border: none;
            cursor: pointer;
            border-radius: 5px;
            transition: background 0.3s;
        }

        #visualize-btn:hover {
            background: #555;
        }

        #output {
            width: 100%;
            height: calc(100% - 60px);
            overflow: auto; /* Enable scrollbars */
        }

        .link {
            fill: none;
            stroke: #555;
            stroke-width: 1.5px;
        }

        .node circle {
            fill: #fff;
            stroke: #333;
            stroke-width: 1.5px;
        }

        .node text {
            font-size: 12px;
        }
    </style>
</head>
<body>

<header>
    <h1>Quadrivium</h1>
</header>

<div id="container">
    <div id="title">Interactive Parsing Tree Visualizer</div>
    <div id="input-section">
        <input type="text" id="sentence-input" placeholder="Enter a sentence (e.g., The cat chased the mouse)">
        <button id="visualize-btn" onclick="generateTree()">Visualize</button>
    </div>
    <div id="output"></div>
</div>
<div id="footer">
    This page is open source and can be edited <a href="https://github.com/standardgalactic/quadrivium/blob/main/index.html">here</a>.
</div>

<script src="https://d3js.org/d3.v6.min.js"></script>
<script>
    async function generateTree() {
        const input = document.getElementById("sentence-input").value.trim();
        if (!input) {
            alert("Please enter a sentence.");
            return;
        }

        const data = parseSentenceToAST(input);
        renderTree(data);
    }

    function parseSentenceToAST(sentence) {
        try {
            const words = sentence.split(/\s+/);
            const ast = {
                name: "Statement",
                children: []
            };

            let currentNode = ast;
            let hasSubject = false;
            let hasVerb = false;

            words.forEach((word, index) => {
                const lowerWord = word.toLowerCase();

                if (["the", "a", "an"].includes(lowerWord) && !hasSubject) {
                    currentNode.children.push({
                        name: "Determiner",
                        children: [{ name: word }]
                    });
                }
                else if (!hasSubject && !["is", "was", "were"].includes(lowerWord)) {
                    currentNode.children.push({
                        name: "Subject",
                        children: [{ name: "NounPhrase", children: [{ name: word }] }]
                    });
                    hasSubject = true;
                }
                else if (hasSubject && !hasVerb) {
                    currentNode.children.push({
                        name: "Predicate",
                        children: [{ name: "Verb", children: [{ name: word }] }]
                    });
                    hasVerb = true;
                }
                else if (hasVerb) {
                    const lastPredicate = currentNode.children.find(c => c.name === "Predicate");
                    if (!lastPredicate.children.some(c => c.name === "Object")) {
                        lastPredicate.children.push({
                            name: "Object",
                            children: [{ name: "NounPhrase", children: [{ name: word }] }]
                        });
                    } else {
                        lastPredicate.children.find(c => c.name === "Object")
                            .children[0].children.push({ name: word });
                    }
                }
            });

            return ast.children.length > 0 ? ast : {
                name: "Error",
                children: [{ name: "Empty sentence" }]
            };
        } catch (e) {
            return {
                name: "Error",
                children: [{ name: "Parsing failed" }]
            };
        }
    }

    function renderTree(data) {
        const output = document.getElementById("output");
        output.innerHTML = "";

        const width = output.clientWidth;
        const height = output.clientHeight;

        const svg = d3.select("#output")
            .append("svg")
            .attr("width", width)
            .attr("height", height)
            .append("g")
            .attr("transform", "translate(120,50)");

        const tree = d3.tree().size([height - 100, width - 240]); // Adjusted width to ensure rightmost words are visible
        const root = d3.hierarchy(data);

        tree(root);

        // Use straight lines instead of curves
        const link = svg.selectAll(".link")
            .data(root.descendants().slice(1))
            .enter().append("line")
            .attr("class", "link")
            .attr("x1", d => d.y)
            .attr("y1", d => d.x)
            .attr("x2", d => d.parent.y)
            .attr("y2", d => d.parent.x);

        const node = svg.selectAll(".node")
            .data(root.descendants())
            .enter().append("g")
            .attr("class", d => "node" + (d.children ? " node--internal" : " node--leaf"))
            .attr("transform", d => `translate(${d.y},${d.x})`);

        node.append("circle")
            .attr("r", 10)
            .attr("fill", d => d.data.name === "Error" ? "#ff4444" : "#fff");

        node.append("text")
            .attr("dy", 3)
            .attr("x", d => d.children ? -15 : 15)
            .style("text-anchor", d => d.children ? "end" : "start")
            .text(d => d.data.name);
    }
</script>

</body>
</html>