Distracters Generation Algorithm for Near-Shaped English Word Combined with its Part of Speech

Article Preview

Abstract:

Low similarity and unreasonable design now appeared in distracters generation of English words in the process of learning English words. This paper proposed a new algorithm to solve this problem by researching Edit Distance and LCS algorithm. Comparing with traditional algorithms, the accuracy of similarity has been improved in this algorithm. Finally, combined with words’ part of speech, we generated more reasonable distracters in the experiments.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3422-3425

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Lidong Ma. Edit distance algorithm and its application in English automatic extraction of Confusing Words In Chinese,. [J]. Intelligent Computer and Applications, 2013 (1): 47-51.

Google Scholar

[2] Deng D, Li G, Feng J, et al. Top-k string similarity search with edit-distance constraints[C]/Data Engineering (ICDE), 2013 IEEE 29th International Conference on. IEEE, 2013: 925-936.

DOI: 10.1109/icde.2013.6544886

Google Scholar

[3] Allison L. Dynamic programming algorithm (DPA) for edit-distance[J]. Algorithms and Data Structures Research & Reference Material. School of Computer Science and Software Engineering, Monash University, Australia, 1999, 3168.

Google Scholar

[4] Tiskin A. Efficient high-similarity string comparison: the water fall algorithm[C]/Proceedings of the Joint EDBT/ICDT 2013 Workshops. ACM, 2013: 358-365.

DOI: 10.1145/2457317.2457384

Google Scholar

[5] Cheatham M, Hitzler P. The role of string similarity metrics in ontology alignment[R]. Tech. rep., Kno. e. sis Center, Wright State University, (2013).

Google Scholar

[6] Grabowski S. New tabulation and sparse dynamic programming based techniques for sequence similarity problems[J]. arXiv preprint arXiv: 1312. 2217, (2013).

Google Scholar

[7] Khan R, Ahmad M, Zakarya M. Longest Common Subsequence Based Algorithm for Measuring Similarity Between Time Series: A New Approach[J]. World Applied Sciences Journal, 2013, 24(9).

Google Scholar