A fuzzy regular expression relaxes exact grammar matching. It selects the closest match among possible regular-expression rules while allowing a bounded number of insertion, deletion, or substitution errors. section 1.9
The technique helps grammar-based assistants by:
- Reducing the brittleness of exact regular-expression matching. section 1.9
- Supporting question-answering and task-execution bots. section 1.9
- Avoiding tokenization or feature generation in the described chatbot approach. section 1.9
Assistant systems
Lex, Siri, and Google Now illustrate the question-answering and task-execution systems that can use fuzzy matching and related techniques to handle approximate grammar matches. section 1.9
The approach improves matching robustness but does not remove the labor of expanding and maintaining a broad set of chatbot behaviors. section 1.9
