libgrammstein 0.1.0

Hybrid language model (N-gram + Embeddings) for WFST text correction
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
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
# Correction Framework

The correction module defines types and traits for representing and applying corrections to source code, integrating with liblevenshtein for fuzzy matching.

## Overview

The correction framework provides:

- **`Correction`**: A suggested fix with confidence score
- **`CorrectionKind`**: Classification of correction types
- **`CorrectionSource`**: Origin of the correction
- **`CodeCorrector`**: Trait for correction providers
- **`CorrectionCandidates`**: Ranked collection of suggestions

## Correction

The `Correction` struct represents a suggested fix:

```rust
pub struct Correction {
    /// The kind of correction
    pub kind: CorrectionKind,
    /// Start byte offset in the source
    pub start_byte: usize,
    /// End byte offset in the source
    pub end_byte: usize,
    /// The original text
    pub original: String,
    /// The suggested replacement text
    pub replacement: String,
    /// Confidence score (0.0 to 1.0)
    pub confidence: f64,
    /// Source of the correction (which component suggested it)
    pub source: CorrectionSource,
    /// Additional context about the correction
    pub context: Option<String>,
}
```

### Creating Corrections

```rust
use libgrammstein::code::{Correction, CorrectionKind, CorrectionSource};

// Basic correction
let correction = Correction::new(
    CorrectionKind::Spelling,
    0,       // start_byte
    5,       // end_byte
    "pritn", // original
    "print", // replacement
);

// With builder pattern
let correction = Correction::new(
    CorrectionKind::Spelling,
    0,
    5,
    "pritn",
    "print",
)
.with_confidence(0.95)
.with_source(CorrectionSource::Lexical)
.with_context("Likely typo in function name");
```

### Applying Corrections

```rust
let source = "pritn(\"hello\")";
let correction = Correction::new(
    CorrectionKind::Spelling,
    0, 5, "pritn", "print"
);

let fixed = correction.apply(source);
assert_eq!(fixed, "print(\"hello\")");
```

### Correction Properties

```rust
let correction = Correction::new(
    CorrectionKind::Spelling,
    0, 5, "pritn", "print"
);

// Check if no-op
if correction.is_noop() {
    println!("No change needed");
}

// Estimate edit distance
let distance = correction.edit_distance();
println!("Edit distance: {}", distance);
```

## CorrectionKind

Classification of correction types:

```rust
pub enum CorrectionKind {
    Spelling,       // Typo correction (retrun -> return)
    Insertion,      // Missing token (add missing ;)
    Deletion,       // Extra token (remove duplicate)
    Replacement,    // Wrong token (semantic)
    VariableMisuse, // Wrong variable name
    TypeError,      // Type mismatch
    MissingImport,  // Import needed
    SyntaxError,    // General syntax fix
    Formatting,     // Whitespace/formatting
    Other,          // Uncategorized
}
```

### Kind Properties

```rust
let kind = CorrectionKind::VariableMisuse;

// Human-readable description
println!("{}", kind.description()); // "Wrong variable name"

// Check if semantic (vs. syntactic)
if kind.is_semantic() {
    println!("Semantic correction (needs type/data flow analysis)");
} else {
    println!("Syntactic correction (lexical/grammar level)");
}
```

### Semantic vs Syntactic

| Kind | Category | Analysis Required |
|------|----------|-------------------|
| `Spelling` | Syntactic | Lexical fuzzy matching |
| `Insertion` | Syntactic | Grammar parsing |
| `Deletion` | Syntactic | Grammar parsing |
| `SyntaxError` | Syntactic | Grammar parsing |
| `Formatting` | Syntactic | Token analysis |
| `VariableMisuse` | Semantic | Data flow analysis |
| `TypeError` | Semantic | Type inference |
| `MissingImport` | Semantic | Symbol resolution |
| `Replacement` | Mixed | Context-dependent |

## CorrectionSource

Origin of a correction suggestion:

```rust
pub enum CorrectionSource {
    Lexical,       // liblevenshtein fuzzy matching
    Grammar,       // PCFG/Earley parsing
    Neural,        // UniXcoder/GNN models
    TypeInference, // Type system analysis
    ControlFlow,   // CFG analysis
    DataFlow,      // DFG analysis
    Combined,      // Ensemble/aggregated
    Unknown,       // Not specified
}
```

### Using Source for Debugging

```rust
for correction in candidates.ranked() {
    match correction.source {
        CorrectionSource::Lexical => {
            println!("From fuzzy matching");
        }
        CorrectionSource::Grammar => {
            println!("From grammar constraints");
        }
        CorrectionSource::Neural => {
            println!("From neural model");
        }
        _ => {}
    }
}
```

## CodeCorrector Trait

The `CodeCorrector` trait defines the interface for correction providers:

```rust
pub trait CodeCorrector: Send + Sync {
    /// Suggests corrections for a token.
    fn correct_token(
        &self,
        token: &CodeToken,
        context: &TokenContext
    ) -> Vec<Correction>;

    /// Suggests corrections for a range of source code.
    fn correct_range(
        &self,
        source: &str,
        start_byte: usize,
        end_byte: usize,
    ) -> Vec<Correction>;

    /// Returns the maximum edit distance considered.
    fn max_edit_distance(&self) -> usize { 2 }

    /// Returns the name of this corrector.
    fn name(&self) -> &str;
}
```

### Implementing a Custom Corrector

```rust
use libgrammstein::code::{
    CodeCorrector, Correction, CorrectionKind, CorrectionSource,
    CodeToken, TokenContext
};

struct MyCustomCorrector {
    dictionary: Vec<String>,
}

impl CodeCorrector for MyCustomCorrector {
    fn correct_token(
        &self,
        token: &CodeToken,
        context: &TokenContext
    ) -> Vec<Correction> {
        let mut corrections = Vec::new();

        // Simple example: check if token is in dictionary
        if !self.dictionary.contains(&token.text) {
            // Find closest match
            for word in &self.dictionary {
                if similar(word, &token.text) {
                    corrections.push(
                        Correction::new(
                            CorrectionKind::Spelling,
                            token.byte_offset,
                            token.byte_offset + token.text.len(),
                            &token.text,
                            word,
                        )
                        .with_source(CorrectionSource::Lexical)
                        .with_confidence(0.8)
                    );
                }
            }
        }

        corrections
    }

    fn correct_range(
        &self,
        source: &str,
        start_byte: usize,
        end_byte: usize,
    ) -> Vec<Correction> {
        // Delegate to token-based correction
        Vec::new()
    }

    fn name(&self) -> &str {
        "MyCustomCorrector"
    }
}
```

## CorrectionCandidates

A ranked collection of correction suggestions:

```rust
pub struct CorrectionCandidates {
    corrections: Vec<Correction>,
    max_candidates: usize,
}
```

### Creating and Using Candidates

```rust
use libgrammstein::code::{
    CorrectionCandidates, Correction, CorrectionKind
};

// Create with maximum capacity
let mut candidates = CorrectionCandidates::new(10);

// Add corrections
candidates.add(
    Correction::new(CorrectionKind::Spelling, 0, 5, "pritn", "print")
        .with_confidence(0.95)
);
candidates.add(
    Correction::new(CorrectionKind::Spelling, 0, 5, "pritn", "pint")
        .with_confidence(0.7)
);

// Get best suggestion
if let Some(best) = candidates.best() {
    println!("Best: {} (confidence: {:.2})", best.replacement, best.confidence);
}

// Get all ranked
for (i, correction) in candidates.ranked().iter().enumerate() {
    println!("{}. {} ({:.2})", i + 1, correction.replacement, correction.confidence);
}
```

### Adding Multiple Candidates

```rust
let lexical_corrections = lexical_corrector.correct_token(&token, &context);
let grammar_corrections = grammar_corrector.correct_token(&token, &context);

let mut candidates = CorrectionCandidates::new(10);
candidates.add_all(lexical_corrections);
candidates.add_all(grammar_corrections);

// Automatically sorted by confidence
```

### Filtering Candidates

```rust
let mut candidates = CorrectionCandidates::new(10);
// ... add corrections ...

// Filter by minimum confidence
candidates.filter_by_confidence(0.5);

// Filter by kind
candidates.filter_by_kind(CorrectionKind::Spelling);

// Filter by source
candidates.filter_by_source(CorrectionSource::Lexical);
```

### Iterating Candidates

```rust
// By reference
for correction in &candidates {
    println!("{} -> {}", correction.original, correction.replacement);
}

// By value (consuming)
for correction in candidates {
    let fixed = correction.apply(source);
}
```

## Confidence Scoring

Confidence scores range from 0.0 to 1.0:

| Score Range | Meaning |
|-------------|---------|
| 0.9 - 1.0 | Very high confidence (exact match, distance 1) |
| 0.7 - 0.9 | High confidence (distance 2, strong context) |
| 0.5 - 0.7 | Medium confidence (multiple sources agree) |
| 0.3 - 0.5 | Low confidence (single source, no context) |
| 0.0 - 0.3 | Very low confidence (weak suggestion) |

### Confidence Calculation Example

```rust
fn calculate_confidence(
    edit_distance: usize,
    token_type: TokenType,
    in_error: bool,
) -> f64 {
    let base = match edit_distance {
        0 => 1.0,
        1 => 0.9,
        2 => 0.7,
        _ => 0.5,
    };

    // Boost for keywords (fixed vocabulary)
    let type_boost = if token_type == TokenType::Keyword {
        1.1
    } else {
        1.0
    };

    // Boost if in error region
    let error_boost = if in_error { 1.1 } else { 1.0 };

    (base * type_boost * error_boost).min(1.0)
}
```

## Applying Multiple Corrections

When applying multiple corrections, apply from end to start:

```rust
fn apply_corrections(source: &str, corrections: &[Correction]) -> String {
    // Sort by start position descending
    let mut sorted: Vec<_> = corrections.iter().collect();
    sorted.sort_by(|a, b| b.start_byte.cmp(&a.start_byte));

    let mut result = source.to_string();
    for correction in sorted {
        result = format!(
            "{}{}{}",
            &result[..correction.start_byte],
            correction.replacement,
            &result[correction.end_byte..]
        );
    }

    result
}
```

## Integration Example

Complete example using the correction framework:

```rust
use libgrammstein::code::{
    CodeParser, CodeTokenizer, LexicalCorrector,
    CorrectionCandidates, Python
};
use std::sync::Arc;

fn correct_code(source: &str) -> String {
    let python = Arc::new(Python::new());
    let mut parser = CodeParser::new(python.clone()).unwrap();

    // Parse
    let parsed = parser.parse(source).unwrap();
    if !parsed.has_errors {
        return source.to_string();
    }

    // Tokenize error regions
    let tokenizer = CodeTokenizer::new(python.as_ref());
    let error_tokens = tokenizer.tokenize_errors(&parsed.tree, source);

    // Create corrector
    let corrector = LexicalCorrector::with_defaults(python);

    // Collect all corrections
    let mut all_corrections = Vec::new();
    for token in error_tokens {
        let mut candidates = CorrectionCandidates::new(5);
        candidates.add_all(corrector.correct_token(&token, &token.context));

        if let Some(best) = candidates.best() {
            if best.confidence >= 0.7 {
                all_corrections.push(best.clone());
            }
        }
    }

    // Apply corrections (from end to start)
    apply_corrections(source, &all_corrections)
}
```

## Thread Safety

All correction types are `Send + Sync`:

```rust
use std::sync::Arc;
use std::thread;

let corrector = Arc::new(LexicalCorrector::with_defaults(python));

let handles: Vec<_> = tokens.into_iter().map(|token| {
    let corrector = Arc::clone(&corrector);
    thread::spawn(move || {
        corrector.correct_token(&token, &token.context)
    })
}).collect();
```

## See Also

- [Correctors Overview](correctors/overview.md) - Corrector implementations
- [Lexical Corrector](correctors/lexical.md) - Fuzzy matching
- [Grammar Corrector](correctors/grammar.md) - PCFG-based
- [Semantic Corrector](correctors/semantic.md) - CPG-based
- [Ensemble Corrector](correctors/ensemble.md) - Combining correctors
- [Pipeline](pipeline.md) - End-to-end workflow