Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 110))

Abstract

This paper proposes a Combination of rules and statistics algorithm. Firstly, this research uses the rule-based approach to identify the abbreviation. Secondly, the full name candidates of the abbreviation are recognized based on n-gram feature. Thirdly, we use the rule and statistic based algorithm to identify the best candidate for the abbreviation. The method of abbreviation recognition has achieved a high accuracy rate, and it is independent, portable and efficient. The method of the full name recognition is superior to the approach introduced in related work on the basis of analyzing and comparing experiment results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Pustejovsky, J., Castano, J., Cochran, B.: Automatic extraction of acronym-meaning pairs from medline databases. Stud. Health Technol. Inform. 10(1), 371–375 (2001)

    Google Scholar 

  2. Taghva, K., Gilbreth, J.: Recognizing Acronym and their Definitions, Technical Report 95-03, Information Science Research Institute, University of Nevada, Las Vegas (June 1995)

    Google Scholar 

  3. Ao, H., Takagi, T.: Alice: An Algorithm to Extract Abbreviations from MEDLINE. J. AM. Med. Inform. Assoc. 12, 576–586 (2005)

    Article  Google Scholar 

  4. Larkey, L.S., Ogilvie, P., Price, M.A., Tamilio, B.: Acrophile: an automated acronym extractor and server. In: Nurnberg, P.J., Hicks, D.L., Furuta, R. (eds.) Proceedings of the 5th ACM International Conference on Digital Libraries, SanAntonio, June 02-07, pp. 205–214. ACM Press (2000)

    Google Scholar 

  5. Yu, H., Hripcsak, G., Friedman, C.: Mapping abbreviations to full forms in biomedical articles. J. AM. Med. Inform. Assoc. 9, 262–272 (2002)

    Article  Google Scholar 

  6. Schwartz, A.S., Hearst, M.A.: A simple algorithm for identifying abbreviation definitions in biomedical text. In: Pacific Symposium on Biocomputing, pp. 451–462 (2003)

    Google Scholar 

  7. Zhou, W., Torvik, V.I., Smalheiser, N.R.: ADAM: another database of abbreviations in MEDLINE. Bioinformatics, 2813–2818 (October 2006)

    Google Scholar 

  8. Okazaki, N., Ananiadou, S.: A general method applicable to the search for simi-larities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443–453 (1970)

    Article  Google Scholar 

  9. Chang, J.T., Schutze, H., Altman, R.B.: Creating an Online Dictionary of Abbreviations from MEDLINE. J. AM. Med. Inform. Assoc. 9, 612–620 (2002)

    Article  Google Scholar 

  10. Park, Y., Byrd, R.J.: Hybrid Text Mining for Finding Abbreviations and Their Definitions. In: Lee, L., Harman, D. (eds.) Proceedings of the 6th Conference on Empirical Methods in Natural Language Processing, Pittsburgh, June 03-04, pp. 126–133. Association for Computational Linguistics Press (2001)

    Google Scholar 

  11. Gale, W.A., Church, K.W., Yarowsky, D.: One Sense Per Discourse. In: Proceedings of the ARPA Workshop on Speech and Natural Language Processing, pp. 233–237 (1992)

    Google Scholar 

  12. Lu, W.-H., Lin, J.-H., Chang, Y.-S.: Improving Translation of Queries with Infrequent Unknown Abbreviations and Proper Names. In: The Association for Computational Linguistics and Chinese Language Processing, pp. 7–9 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hua, Y., Yu, H., Zhenwei, H., Jianmin, Y., Mingming, Z., Yanhui, F. (2011). Combination Method of Rules and Statistics for Abbreviation and Its Full Name Recognition. In: Jiang, L. (eds) Proceedings of the 2011 International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011) November 19-20, 2011, Melbourne, Australia. Advances in Intelligent and Soft Computing, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25185-6_90

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25185-6_90

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25184-9

  • Online ISBN: 978-3-642-25185-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics