3 ms·
Could matching algorithms be expressed as a graph of tensorflow primitive ops and run on Google's TPU?
by antpls 7y ago
Could matching algorithms be expressed as a graph of tensorflow primitive ops and run on Google's TPU?
- glangdale 7y agoI suspect yes. This would be a wonderful project for someone. Do note that many regexes can be expressed as a dataflow problem. We had an experimental subsystem (called "Puggsley") that was a data-parallel take on the problem; this wasn't published, but is pretty much an independent invention of the same ideas in icgrep. The major headache is the prospect of loops that are bigger than 1 character position - these aren't as trivial to express (I have ideas, naturally). I don't know how well this fits in with Tensorflow - it may be too finegrained? But of course, getting onto custom hardware can yield massive speedups.