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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
|
use std::fmt;
use std::fs;
use std::io::{self, BufRead};
use crate::sparse_vector::SparseVector;
#[derive(Debug, Clone, PartialEq)]
pub enum Symbol {
T(String),
NT { symbol: String, index: i32 },
}
impl Symbol {
pub fn parse(s: &str) -> Symbol {
let s = s.trim();
if s.starts_with('[') && s.ends_with(']') {
let inner = &s[1..s.len() - 1];
if let Some((sym, idx)) = inner.split_once(',') {
Symbol::NT {
symbol: sym.trim().to_string(),
index: idx.trim().parse::<i32>().unwrap() - 1,
}
} else {
Symbol::NT {
symbol: inner.trim().to_string(),
index: -1,
}
}
} else {
Symbol::T(s.to_string())
}
}
pub fn is_nt(&self) -> bool {
matches!(self, Symbol::NT { .. })
}
pub fn is_t(&self) -> bool {
matches!(self, Symbol::T(_))
}
pub fn word(&self) -> &str {
match self {
Symbol::T(w) => w,
Symbol::NT { .. } => panic!("word() called on NT"),
}
}
pub fn nt_symbol(&self) -> &str {
match self {
Symbol::NT { symbol, .. } => symbol,
Symbol::T(_) => panic!("nt_symbol() called on T"),
}
}
pub fn nt_index(&self) -> i32 {
match self {
Symbol::NT { index, .. } => *index,
Symbol::T(_) => panic!("nt_index() called on T"),
}
}
}
impl fmt::Display for Symbol {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Symbol::T(w) => write!(f, "{}", w),
Symbol::NT { symbol, index } if *index >= 0 => {
write!(f, "[{},{}]", symbol, index + 1)
}
Symbol::NT { symbol, .. } => write!(f, "[{}]", symbol),
}
}
}
fn splitpipe(s: &str, n: usize) -> Vec<&str> {
let mut parts = Vec::new();
let mut rest = s;
for _ in 0..n {
if let Some(pos) = rest.find("|||") {
parts.push(rest[..pos].trim());
rest = rest[pos + 3..].trim();
} else {
break;
}
}
parts.push(rest.trim());
parts
}
#[derive(Debug, Clone)]
pub struct Rule {
pub lhs: Symbol,
pub rhs: Vec<Symbol>,
pub target: Vec<Symbol>,
pub map: Vec<i32>,
pub f: SparseVector,
pub arity: usize,
}
impl Rule {
pub fn new(
lhs: Symbol,
rhs: Vec<Symbol>,
target: Vec<Symbol>,
map: Vec<i32>,
f: SparseVector,
) -> Self {
let arity = rhs.iter().filter(|s| s.is_nt()).count();
Self {
lhs,
rhs,
target,
map,
f,
arity,
}
}
pub fn from_str(s: &str) -> Self {
let parts = splitpipe(s, 3);
let lhs = Symbol::parse(parts[0]);
let mut map = Vec::new();
let mut arity = 0;
let rhs: Vec<Symbol> = parts[1]
.split_whitespace()
.map(|tok| {
let sym = Symbol::parse(tok);
if let Symbol::NT { index, .. } = &sym {
map.push(*index);
arity += 1;
}
sym
})
.collect();
let target: Vec<Symbol> = parts[2]
.split_whitespace()
.map(|tok| Symbol::parse(tok))
.collect();
let f = if parts.len() > 3 && !parts[3].is_empty() {
SparseVector::from_kv(parts[3], '=', ' ')
} else {
SparseVector::new()
};
Self {
lhs,
rhs,
target,
map,
f,
arity,
}
}
}
impl fmt::Display for Rule {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(
f,
"{} ||| {} ||| {}",
self.lhs,
self.rhs
.iter()
.map(|s| s.to_string())
.collect::<Vec<_>>()
.join(" "),
self.target
.iter()
.map(|s| s.to_string())
.collect::<Vec<_>>()
.join(" "),
)
}
}
pub struct Grammar {
pub rules: Vec<Rule>,
pub start_nt: Vec<usize>,
pub start_t: Vec<usize>,
pub flat: Vec<usize>,
pub start_t_by_word: std::collections::HashMap<String, Vec<usize>>,
pub flat_by_first_word: std::collections::HashMap<String, Vec<usize>>,
pub start_nt_by_symbol: std::collections::HashMap<String, Vec<usize>>,
}
impl Grammar {
pub fn from_file(path: &str) -> io::Result<Self> {
let file = fs::File::open(path)?;
let reader = io::BufReader::new(file);
let mut rules = Vec::new();
let mut start_nt = Vec::new();
let mut start_t = Vec::new();
let mut flat = Vec::new();
let mut start_t_by_word: std::collections::HashMap<String, Vec<usize>> =
std::collections::HashMap::new();
let mut flat_by_first_word: std::collections::HashMap<String, Vec<usize>> =
std::collections::HashMap::new();
let mut start_nt_by_symbol: std::collections::HashMap<String, Vec<usize>> =
std::collections::HashMap::new();
for line in reader.lines() {
let line = line?;
let line = line.trim().to_string();
if line.is_empty() {
continue;
}
let idx = rules.len();
let rule = Rule::from_str(&line);
if rule.rhs.first().map_or(false, |s| s.is_nt()) {
start_nt_by_symbol
.entry(rule.rhs[0].nt_symbol().to_string())
.or_default()
.push(idx);
start_nt.push(idx);
} else if rule.arity == 0 {
flat_by_first_word
.entry(rule.rhs[0].word().to_string())
.or_default()
.push(idx);
flat.push(idx);
} else {
start_t_by_word
.entry(rule.rhs[0].word().to_string())
.or_default()
.push(idx);
start_t.push(idx);
}
rules.push(rule);
}
Ok(Self {
rules,
start_nt,
start_t,
flat,
start_t_by_word,
flat_by_first_word,
start_nt_by_symbol,
})
}
pub fn add_glue_rules(&mut self) {
let symbols: Vec<String> = self
.rules
.iter()
.map(|r| r.lhs.nt_symbol().to_string())
.filter(|s| s != "S")
.collect::<std::collections::HashSet<_>>()
.into_iter()
.collect();
let mut once = false;
for symbol in symbols {
let idx = self.rules.len();
self.rules.push(Rule::new(
Symbol::NT {
symbol: "S".to_string(),
index: -1,
},
vec![Symbol::NT {
symbol: symbol.clone(),
index: 0,
}],
vec![Symbol::NT {
symbol: symbol.clone(),
index: 0,
}],
vec![0],
SparseVector::new(),
));
self.start_nt.push(idx);
self.start_nt_by_symbol
.entry(symbol)
.or_default()
.push(idx);
once = true;
}
if once {
let idx = self.rules.len();
self.rules.push(Rule::new(
Symbol::NT {
symbol: "S".to_string(),
index: -1,
},
vec![
Symbol::NT {
symbol: "S".to_string(),
index: 0,
},
Symbol::NT {
symbol: "X".to_string(),
index: 1,
},
],
vec![
Symbol::NT {
symbol: "S".to_string(),
index: 0,
},
Symbol::NT {
symbol: "X".to_string(),
index: 1,
},
],
vec![0, 1],
SparseVector::new(),
));
self.start_nt.push(idx);
self.start_nt_by_symbol
.entry("S".to_string())
.or_default()
.push(idx);
}
}
pub fn add_pass_through_rules(&mut self, words: &[String]) {
for word in words {
let idx = self.rules.len();
self.rules.push(Rule::new(
Symbol::NT {
symbol: "X".to_string(),
index: -1,
},
vec![Symbol::T(word.clone())],
vec![Symbol::T(word.clone())],
vec![],
SparseVector::new(),
));
self.flat.push(idx);
self.flat_by_first_word
.entry(word.clone())
.or_default()
.push(idx);
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_symbol_parse_t() {
let s = Symbol::parse("hello");
assert_eq!(s, Symbol::T("hello".to_string()));
}
#[test]
fn test_symbol_parse_nt() {
let s = Symbol::parse("[NP,1]");
assert_eq!(
s,
Symbol::NT {
symbol: "NP".to_string(),
index: 0
}
);
}
#[test]
fn test_symbol_parse_nt_no_index() {
let s = Symbol::parse("[S]");
assert_eq!(
s,
Symbol::NT {
symbol: "S".to_string(),
index: -1
}
);
}
#[test]
fn test_rule_from_str() {
let r = Rule::from_str("[NP] ||| ein [NN,1] ||| a [NN,1] ||| logp=0 use_a=1.0");
assert_eq!(r.lhs.nt_symbol(), "NP");
assert_eq!(r.rhs.len(), 2);
assert_eq!(r.target.len(), 2);
assert_eq!(r.map, vec![0]);
assert_eq!(r.arity, 1);
assert_eq!(*r.f.map.get("use_a").unwrap(), 1.0);
}
#[test]
fn test_rule_display() {
let r = Rule::from_str("[S] ||| [NP,1] [VP,2] ||| [NP,1] [VP,2] ||| logp=0");
assert_eq!(r.to_string(), "[S] ||| [NP,1] [VP,2] ||| [NP,1] [VP,2]");
}
}
|