Abstract
Supervising and standardizing the price of drug as well as the quality has become a big problem for drug supervision departments. The system improves the study function for drug alias. The significant problem solved in this system is the Chinese Drug Match, and it will consider those problems about drug name abbreviation and alias. The system solves this problem with two tactics: the maximum matching method implement the word segmentation function with executing corporate with Chinese pinyin translate algorithm, and using the Levenshtein Distance method to compute the matching degree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wong, P.-K., Chan, C.: Chinese Word Segmentation based on Maximum Matching and Word Binding Forc. The University of Hong Kong (1996)
Gilleland, M.: Levenshtein Distance, in Three Flavors, http://www.merriampark.com
Shawe-Taylor, J.: Fast string matching in a stationary ergodic sourc. University of London (1990)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM (1977)
Hatcher, E., Gospodnetic, O.: Lucene in Action. Manning Publications (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, X., Chen, L., Zhu, C. (2012). The Design and Implementation of Automatic Drug Matching System. In: Lei, J., Wang, F.L., Li, M., Luo, Y. (eds) Network Computing and Information Security. NCIS 2012. Communications in Computer and Information Science, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35211-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-35211-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35210-2
Online ISBN: 978-3-642-35211-9
eBook Packages: Computer ScienceComputer Science (R0)