The Adaptive Spelling Error Checking Algorithm based on Trie Tree

DOI

10.2991/aeece-16.2016.62How to use a DOI?

Keywords

trie tree;edit distance;dynamic programming;spelling error correction

Abstract

In many applications, the function of spelling error checking and auto-complete according to the user's input is very popular. The spelling error checking algorithm based on the dictionary is very fast to find the word written correctly, but need to recalculate the edit distance of a large number of related words if there is a input error.In this text, the adaptive spelling error checking algorithm based on Trie tree processes both the correct input and the incorrect input synchronously, reduce the amount of calculation of edit distance by the Trie tree and stack, and reduce the time complexity. At the same time, the statistical analysis is carried out on the user's inputs, and improve the accuracy of the feedback results by a large amount of data. Practice results show that the time complexity of the new algorithm is decreased obviously compared with the other similar algorithms.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yongbing Xu
AU  - Junyi Wang
PY  - 2016/07
DA  - 2016/07
TI  - The Adaptive Spelling Error Checking Algorithm based on Trie Tree
BT  - Proceedings of the 2016 2nd International Conference on Advances in Energy, Environment and Chemical Engineering (AEECE 2016)
PB  - Atlantis Press
SP  - 299
EP  - 302
SN  - 2352-5401
UR  - https://doi.org/10.2991/aeece-16.2016.62
DO  - 10.2991/aeece-16.2016.62
ID  - Xu2016/07
ER  -