Dictionary Matching Algorithm
(Redirected from Dictionary matching)
Jump to navigation
Jump to search
A Dictionary Matching Algorithm is a Matching Algorithm that can solve a Word Classification Task.
- See: Lexical Database, WSD Algorithm.
References
2006
- (Chun et al., 2006) ⇒ Hong-woo Chun, Yoshimasa Tsuruoka, Jin-Dong Kim, Rie Shiba, Naoki Nagata, Teruyoshi Hishiki, and Jun'ichi Tsujii. (2006). “Extraction of Gene-Disease Relations from Medline Using Domain Dictionaries and Machine Learning." In. Proceedings of the 11th Pacific Symposium on Biocomputing (PSB 2006).
- QUOTE: We constructed a dictionary for disease and gene names from six public databases and extracted relation candidates by dictionary matching. Since dictionary matching produces a large number of false positives, we developed a method of machine learning-based named entity recognition (NER) to filter out false recognitions of disease/gene names
2004
- (Cole et al., 2004) ⇒ Richard Cole, Lee-Ad Gottlieb, and Moshe Lewenstein. (2004). “Dictionary Matching and Indexing with Errors and Don't Cares.” In: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (STOC 2004). doi:10.1145/1007352.1007374