Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai    |    Awaiting the gospel from Sarah Connor    |    1,954 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 567 of 1,954    |
|    Ted Dunning to All    |
|    Re: RNNs and LSTMs for Noisy Substring M    |
|    18 Jan 05 19:32:09    |
      From: tdunning@san.rr.com              Recurrent neural nets are probably massive overkill for a problem like       this.              You should start with sub-string presence or absence as a proxy for       string edit distance. You can even use the sub-strings to generate       hints for dynamic programming based edit distance systems.              Remember that weighted sub-string matching is just a handy way of       encoding a Markov model. As such, it has enormous power for doing       string matching sorts of operations.       What made you think that fancy stuff was needed?              [ comp.ai is moderated. To submit, just post and be patient, or if ]       [ that fails mail your article to |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca