Approximate membership for regular languages modulo the edit distance.
Antoine NdioneAurélien LemayJoachim NiehrenPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- edit distance
- regular languages
- approximate matching
- regular expressions
- tree edit distance
- grammatical inference
- finite automata
- graph matching
- similarity measure
- decision problems
- distance measure
- pac learning
- context free grammars
- distance function
- positive data
- pattern matching
- query language
- dynamic programming
- xml schema
- data model
- pairwise