Syntactic Pattern Recognition Using Finite Inductive Strings

A syntactic pattern recognition technique is described based upon a mathematical principle associated with finite sequences of symbols. The technique allows for fast recognition of patterns within strings, including the ability to recognize expected symbols that are close to the desired symbols, and mutations as well as both local and global substring matching. This allowance of deviation permits sequences to be subject to error and still be recognized. Some examples are provided illustrating the technique.

• Type: Conference
• Year: 2009
• Where: PRIB
• Authors: Paul S. Fisher, Howard Fisher, Jinsuk Baek, Cleopas O. Angaye
• Keywords: Finite Sequences, Global Substring Matching, Pattern Recognition Technique, PRIB 2009