エイホ-コラシック法
1. Aho–Corasick string matching algorithmIn computer science, the Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the "dictionary") within an input text. It matches all patterns simultaneously. The complexity of the algorithm is linear in the length of the patterns plus the length of the searched text plus the number of output matches.
Read “Aho–Corasick string matching algorithm” on English Wikipedia
Read “エイホ-コラシック法” on Japanese Wikipedia
Read “Aho–Corasick string matching algorithm” on DBpedia
Read “Aho–Corasick string matching algorithm” on English Wikipedia
Read “エイホ-コラシック法” on Japanese Wikipedia
Read “Aho–Corasick string matching algorithm” on DBpedia
Discussions
Log in to talk about this word.