Talk:Aho–Corasick algorithm: Difference between revisions

Revision as of 18:45, 21 September 2016

Revision as of 18:47, 9 May 2017

Line 43:

::I didn't look at either one, just wondered why one and not the other. Funny story, it seems that the algorithm was rediscovered by people working at the NCBI <ref name="NCBI">{{cite web|title=National Center for Biotechnology Information|url=http://www.ncbi.nlm.nih.gov|website=www.ncbi.nlm.nih.gov|publisher=NCBI|accessdate=21 September 2016}}</ref> in developing BLAST <ref name="BLAST">{{cite web|title=BLAST|url=https://blast.ncbi.nlm.nih.gov/Blast.cgi|website=blast.ncbi.nlm.nih.gov|publisher=NCBI|accessdate=21 September 2016}}</ref> software for DNA and protein sequence searching. I used their implementation, and cited it, for a project I was working on, and then someone told me that it was Aho-Corasick. I told the BLAST people, and they agreed. I suppose I could add BLAST to the external links section. It is definitely production level software, produced with government funding, not someone at home. I believe it is all C. [[User:Gah4|Gah4]] ([[User talk:Gah4|talk]]) 18:45, 21 September 2016 (UTC)

== What are the input what is the output ==

It's not clear reading the article what must be the input? A dictionary of words (a set actually) and an array of chars aka. a string. Or it's an operation on two sets of words to see doing the intersection? What is the output? [[User:Iamamz3|i⋅am⋅amz3]] ([[User talk:Iamamz3|talk]]) 18:47, 9 May 2017 (UTC)

== Aho Corasick vs TF-IDF ==

How does compare Aho Corasick to a search engine retrivial scoring function like TF-IDF? [[User:Iamamz3|i⋅am⋅amz3]] ([[User talk:Iamamz3|talk]]) 18:47, 9 May 2017 (UTC)

—