Problemintro
Approximate string matching
Also called approximate pattern matching, fuzzy string matching.
Find all text positions where a pattern matches within a bounded number of errors.
Find all text positions where a pattern matches within a bounded number of errors.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag NGNQGX Edit this page History Report an error