Skip to main content

Evolutionary Ranking on Multiple Word Correction Algorithms Using Neural Network Approach

  • Conference paper
Engineering Applications of Neural Networks (EANN 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 43))

Abstract

Multiple algorithms have been developed to correct user’s typing mistakes. However, an optimum solution is hardly identified among them. Moreover, these solutions rarely produce a single answer or share common results, and the answers may change with time and context. These have led this research to combine some distinct word correction algorithms to produce an optimal prediction based on database updates and neural network learning. In this paper, three distinct typing correction algorithms are integrated as a pilot research. Key factors including Time Change, Context Change and User Feedback are considered. Experimental results show that 57.50% Ranking First Hitting Rate (HR) with the samples of category one and a best Ranking First Hitting Rate of 74.69% within category four are achieved.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Ouazzane, K., Li, J., et al.: A hybrid framework towards the solution for people with disability effectively using computer keyboard. In: IADIS International Conference Intelligent Systems and Agents 2008, pp. 209–212 (2008)

    Google Scholar 

  2. Metaphone, http://en.wikipedia.org/wiki/Metaphone (accessed January 23, 2009)

  3. N-gram, http://en.wikipedia.org/wiki/N-gram (accessed January 18, 2009)

  4. Levenshtein algorithm, http://www.levenshtein.net/ (accessed January 23, 2009)

  5. Cohen, W.W., Ravikumar, P., Fienberg, S.: A Comparison of String Distance Metrics for Name-Matching Tasks. In: IIWeb 2003, pp. 73–78 (2003)

    Google Scholar 

  6. Jaro-Winkler distance, http://en.wikipedia.org/wiki/Jaro-Winkler (accessed January 23, 2009)

  7. Far from the Madding Crowd, http://en.wikipedia.org/wiki/Far_from_the_Madding_Crowd (accessed April 15, 2009)

  8. Calgary Corpus, ftp://ftp.cpsc.ucalgary.ca/pub/projects/text.compression.corpus/text.compression.corpus.tar.Z (accessed January 18, 2009)

  9. Davis, M.: Reading jumbled texts, http://www.mrc-cbu.cam.ac.uk/~mattd/Cmabrigde/ (accessed January 26, 2009)

  10. Disability Essex, http://www.disabilityessex.org (accessed January 18, 2009)

  11. Knowledge Transfer Partnership, http://www.ktponline.org.uk/ (accessed January 18, 2009)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, J., Ouazzane, K., Jing, Y., Kazemian, H., Boyd, R. (2009). Evolutionary Ranking on Multiple Word Correction Algorithms Using Neural Network Approach. In: Palmer-Brown, D., Draganova, C., Pimenidis, E., Mouratidis, H. (eds) Engineering Applications of Neural Networks. EANN 2009. Communications in Computer and Information Science, vol 43. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03969-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03969-0_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03968-3

  • Online ISBN: 978-3-642-03969-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics