{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:54:30Z","timestamp":1740174870310,"version":"3.37.3"},"reference-count":25,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T00:00:00Z","timestamp":1626393600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"],"award-info":[{"award-number":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"],"award-info":[{"award-number":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"],"award-info":[{"award-number":["NRF-2019S1A5A2A03049825","NRF-2020R1A2C2007091"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Information Systems"],"published-print":{"date-parts":[[2021,7,16]]},"abstract":"<jats:p>The most typical problem in an analysis of natural language is finding synonyms of out-of-vocabulary (OOV) words. When someone tries to understand a sentence containing an OOV word, the person determines the most appropriate meaning of a replacement word using the meanings of co-occurrence words under the same context based on the conceptual system learned. In this study, a word-to-vector and conceptual relationship (Word2VnCR) algorithm is proposed that replaces an OOV word leading to an erroneous morphemic analysis with an appropriate synonym. TheWord2VnCR algorithm is an improvement over the conventional Word2Vec algorithm, which has a problem in suggesting a replacement word by not determining the similarity of the word. After word-embedding learning is conducted using the learning dataset, the replacement word candidates of the OOV word are extracted. The semantic similarities of the extracted replacement word candidates are measured with the surrounding neighboring words of the OOV word, and a replacement word having the highest similarity value is selected as a replacement. To evaluate the performance of the proposed Word2VnCR algorithm, a comparative experiment was conducted using the Word2VnCR and Word2Vec algorithms. As the experimental results indicate, the proposed algorithm shows a higher accuracy than the Word2Vec algorithm.<\/jats:p>","DOI":"10.1155\/2021\/5548426","type":"journal-article","created":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T18:35:19Z","timestamp":1626546919000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Replacing Out-of-Vocabulary Words with an Appropriate Synonym Based on Word2VnCR"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5743-0955","authenticated-orcid":true,"given":"Jeongin","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Chosun University, Gwangju 61452, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1189-4041","authenticated-orcid":true,"given":"Taekeun","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Chosun University, Gwangju 61452, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0111-5152","authenticated-orcid":true,"given":"Pankoo","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Chosun University, Gwangju 61452, Republic of Korea"}]}],"member":"311","reference":[{"volume-title":"Mechanical Engineering Dictionary","year":"2007","author":"T. Atkins","key":"1"},{"volume-title":"Computer Internet IT Glossary","year":"2005","author":"Computational Terminology Compilation Committee","key":"2"},{"key":"3"},{"key":"4"},{"key":"5"},{"issue":"41","key":"6","article-title":"Traffic classification using the automated training set composition with the LCS algorithm","volume":"1","author":"L. Yongho","year":"2013","journal-title":"Journal of KISS: Information Networking"},{"volume-title":"Learning TensorFlow","author":"H. Tom","key":"7"},{"key":"8","unstructured":"YoonshikT.Self-organizing n-gram model for automaticword spacin2007Daegu, South KoreaGyeongpook National UniversityM.Sc. thesis"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0790-8_15"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1108\/00330330810912142"},{"key":"11","unstructured":"YoungshinY.Relationship analysis of disease and biomarker\/microorganisms using word embeddin2017Chuncheon, South KoreaHallym UniversityM.Sc. thesis"},{"key":"12","unstructured":"ByeonghunY.Correlation analysis of chronic obstructive pulmonary disease (copd) and its biomarkers using word embedding2018Chuncheon, South KoreaHallym UniversityMaster\u2019s Thesis"},{"first-page":"668","article-title":"Domain-specific keyphrase extraction","author":"E. Frank","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/11775300_8"},{"key":"15","unstructured":"KeithH. J. B.Phraserate: an html keyphrase extracto200216Riverside, CA, USAUniversity of CaliforniaTechnical Report"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1142\/s0218213004001466"},{"article-title":"Improved automatic keyword extraction given more linguistic knowledge","author":"A. Hulth","key":"17","doi-asserted-by":"crossref","DOI":"10.3115\/1119355.1119383"},{"author":"T. Mikolov","key":"18","article-title":"Efficient estimation of word representations in vector space"},{"key":"19"},{"article-title":"Distributed representations of words and phrases and their compositionality","year":"2013","author":"M. Tmoams","key":"20"},{"key":"21","article-title":"Creating a live, public short message service corpus: the NUS SMS corpus","volume-title":"Language Resources and Evaluation","author":"C. Tao","year":"2013"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/ijl\/3.4.235","article-title":"Introduction to wordnet: an on-line lexical database","author":"G. A. Miller","year":"1990","journal-title":"International Journal of Lexicography"},{"first-page":"214","volume-title":"NLTK: the natural language toolkit","author":"B. Steven","key":"24"},{"key":"25","first-page":"507","article-title":"Large-margin softmax loss for convolutional neural networks","volume":"48","author":"L. Weiyang","year":"2016","journal-title":"Proceedings of the 33rd International Conference on Machine Learning"}],"container-title":["Mobile Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2021\/5548426.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2021\/5548426.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2021\/5548426.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T18:35:30Z","timestamp":1626546930000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/misy\/2021\/5548426\/"}},"subtitle":[],"editor":[{"given":"Jong M.","family":"Choi","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,7,16]]},"references-count":25,"alternative-id":["5548426","5548426"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5548426","relation":{},"ISSN":["1875-905X","1574-017X"],"issn-type":[{"type":"electronic","value":"1875-905X"},{"type":"print","value":"1574-017X"}],"subject":[],"published":{"date-parts":[[2021,7,16]]}}}