{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:17:11Z","timestamp":1649207831322},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1587\/transinf.2017edp7284","type":"journal-article","created":{"date-parts":[[2018,6,30]],"date-time":"2018-06-30T22:28:51Z","timestamp":1530397731000},"page":"1938-1945","source":"Crossref","is-referenced-by-count":1,"title":["Error Correction for Search Engine by Mining Bad Case"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Jianyong","family":"DUAN","sequence":"first","affiliation":[{"name":"College of Computer Science & Technology, North China University of Technology"},{"name":"Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianxiao","family":"JI","sequence":"additional","affiliation":[{"name":"College of Computer Science & Technology, North China University of Technology"},{"name":"Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"WANG","sequence":"additional","affiliation":[{"name":"College of Computer Science & Technology, North China University of Technology"},{"name":"Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] R. Cen, Y. Liu, M. Zhang, R.U. Liyun, and M.A. Shaoping, \u201cSearch engine user behavior analysis based on log mining,\u201d Journal of Chinese Information Processing, 2010."},{"key":"2","unstructured":"[2] D. Sullivan, \u201cSearch engine size wars v erupts,\u201d Search Engine Watch, vol.11, 2004."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] E. Mays, F.J. Damerau, and R.L. Mercer, \u201cContext based spelling correction,\u201d Information Processing &amp; Management, vol.27, no.5, pp.517-522, 1991. 10.1016\/0306-4573(91)90066-u","DOI":"10.1016\/0306-4573(91)90066-U"},{"key":"4","unstructured":"[4] Y. Zhang, \u201cThe structuring method of correcting knowledge sets and the producing algorithm of correcting suggestion in the chinese text proofreading system,\u201d Journal of Chinese Information Processing, 2001."},{"key":"5","unstructured":"[5] X. Sun, J. Gao, D. Micol, and C. Quirk, \u201cLearning phrase-based spelling error models from clickthrough data,\u201d Meeting of the Association for Computational Linguistics, pp.266-274, 2010."},{"key":"6","unstructured":"[6] J. Gao, X. Li, D. Micol, C. Quirk, and X. Sun, \u201cA large scale ranker-based system for search query spelling correction,\u201d International Conference on Computational Linguistics, pp.358-366, 2010."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] H. Duan and B.J. Hsu, \u201cOnline spelling correction for query completion,\u201d International Conference on World Wide Web, pp.117-126, 2011. 10.1145\/1963405.1963425","DOI":"10.1145\/1963405.1963425"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] C. Silverstein, H. Marais, M. Henzinger, and M. Moricz, \u201cAnalysis of a very large web search engine query log,\u201d ACm SIGIR Forum, vol.33, no.1, pp.6-12, ACM, 1999. 10.1145\/331403.331405","DOI":"10.1145\/331403.331405"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] A. Broder, \u201cA taxonomy of web search,\u201d Acm Sigir Forum, vol.36, no.2, pp.3-10, 2002. 10.1145\/792550.792552","DOI":"10.1145\/792550.792552"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] S. Park, J.H. Lee, and H.J. Bae, \u201cEnd user searching: A web log analysis of naver, a korean web search engine,\u201d Library &amp; Information Science Research, vol.27, no.2, pp.203-221, 2005. 10.1016\/j.lisr.2005.01.013","DOI":"10.1016\/j.lisr.2005.01.013"},{"key":"11","unstructured":"[11] W. Li, Y. Yang, H. Jin, L. Tan, M. Ren, and S. Zhang, \u201cSearch engine log based user behavior analysis,\u201d Energy Procedia, vol.13, pp.5082-5091, 2011."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] M. Delgado, M.D. Ruiz, and D. S\u00e1nchez, \u201cStudying interest measures for association rules through a logical model,\u201d International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.18, no.1, pp.87-106, 2010. 10.1142\/s0218488510006404","DOI":"10.1142\/S0218488510006404"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Z.-P. Zhao, Z.-M. Yin, Q.-P. Wang, X.-Z. Xu, and H.-F. Jiang, \u201cAn improved algorithm of levenshtein distance and its application in data processing,\u201d Journal of Computer Applications, vol.29, no.2, pp.424-426, 2009. 10.3724\/sp.j.1087.2009.00424","DOI":"10.3724\/SP.J.1087.2009.00424"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] T. Akutsu, D. Fukagawa, and A. Takasu, \u201cApproximating tree edit distance through string edit distance,\u201d Algorithmica, vol.57, no.2, pp.325-348, 2010. 10.1007\/s00453-008-9213-z","DOI":"10.1007\/s00453-008-9213-z"},{"key":"15","unstructured":"[15] H. Jiang, A.Q. Han, M.J. Wang, Z. Wang, and W.U. Yun-Ling, \u201cSolution algorithm of string similarity based on improved levenshtein distance,\u201d Computer Engineering, vol.40, no.1, pp.222-227, 2014."},{"key":"16","unstructured":"[16] Q. Chen, M. Li, and M. Zhou, \u201cImproving query spelling correction using web search results,\u201d EMNLP-CoNLL 2007, Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, June 28-30, 2007, Prague, Czech Republic, pp.181-189, 2007."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/7\/E101.D_2017EDP7284\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,7]],"date-time":"2018-07-07T04:57:27Z","timestamp":1530939447000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/7\/E101.D_2017EDP7284\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017edp7284","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}