Hi Martin, On Wed, 2006-09-20 at 14:27 +0100, Martin Ritchie wrote: > I would be interested in discussing your approach to topic pattern > My first cut is fairly brain-dead, just doing a linear search over a set of normalized patterns matching one pattern at a time. I'm doing # matching by simple recursive lookahead which can certainly be done better.
For the next round I had been thinking that a decision tree which would help with patterns that have common prefixes. # matching becomes interesting there because you have to look down all the branches below you to find the end of the # sequence - I'm wondering if you could put shortcut hashmaps into the tree to speed this up. (Hmm, I could put shortcut hashmaps into my simple single pattern match ...) I'm very interested to hear your FSA idea - I should have the brain-dead C++ impl done today so you can take a look.
