• Title/Summary/Keyword: 단어 오류

Search Result 213, Processing Time 0.028 seconds

Alleviating Semantic Term Mismatches in Korean Information Retrieval (한국어 정보 검색에서 의미적 용어 불일치 완화 방안)

  • Yun, Bo-Hyun;Park, Sung-Jin;Kang, Hyun-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3874-3884
    • /
    • 2000
  • An information retrieval system has to retrieve all and only documents which are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and qucry terms have been a serious obstacle to the enhancement of retrieval performance. In this paper, we discuss automatic term normalization between words in text corpora and their application to a Korean information retrieval system. We perform two types of term normalizations to alleviate semantic term mismatches: equivalence class and co-occurrence cluster. First, transliterations, spelling errors, and synonyms are normalized into equivalence classes bv using contextual similarity. Second, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using K-means algorithm and co-occurrence clusters are identified. In this paper, these normalized term products are used in the query expansion to alleviate semantic tem1 mismatches. In other words, we utilize two kinds of tcrm normalizations, equivalence class and co-occurrence cluster, to expand user's queries with new tcrms, in an attempt to make user's queries more comprehensive (adding transliterations) or more specific (adding spc'Cializationsl. For query expansion, we employ two complementary methods: term suggestion and term relevance feedback. The experimental results show that our proposed system can alleviatl' semantic term mismatches and can also provide the appropriate similarity measurements. As a result, we know that our system can improve the rctrieval efficiency of the information retrieval system.

  • PDF

Development of Similar Bibliographic Retrieval System based on Neighboring Words and Keyword Topic Information (인접한 단어와 키워드 주제어 정보에 기반한 유사 문헌 검색 시스템 개발)

  • Kim, Kwang-Young;Kwak, Seung-Jin
    • Journal of Korean Library and Information Science Society
    • /
    • v.40 no.3
    • /
    • pp.367-387
    • /
    • 2009
  • The similar bibliographic retrieval system follows whether it selects a thing of the extracted index term and or not the difference in which the similar document retrieval system There be many in the search result is generated. In this research, the method minimally making the error of the selection of the extracted candidate index term is provided In this research, the word information in which it is adjacent by using candidate index terms extracted from the similar literature and the keyword topic information were used. And by using the related author information and the reranking method of the search result, the similar bibliographic system in which an accuracy is high was developed. In this paper, we conducted experiments for similar bibliographic retrieval system on a collection of Korean journal articles of science and technology arena. The performance of similar bibliographic retrieval system was proved through an experiment and user evaluation.

  • PDF

Error Correction in Korean Morpheme Recovery using Deep Learning (딥 러닝을 이용한 한국어 형태소의 원형 복원 오류 수정)

  • Hwang, Hyunsun;Lee, Changki
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1452-1458
    • /
    • 2015
  • Korean Morphological Analysis is a difficult process. Because Korean is an agglutinative language, one of the most important processes in Morphological Analysis is Morpheme Recovery. There are some methods using Heuristic rules and Pre-Analyzed Partial Words that were examined for this process. These methods have performance limits as a result of not using contextual information. In this study, we built a Korean morpheme recovery system using deep learning, and this system used word embedding for the utilization of contextual information. In '들/VV' and '듣/VV' morpheme recovery, the system showed 97.97% accuracy, a better performance than with SVM(Support Vector Machine) which showed 96.22% accuracy.

A Study on Design and Implementation of Filtering System on Hurtfulness Site (유해 사이트 필터링에 관한 연구)

  • 장혜숙;강일고;박기홍
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.636-639
    • /
    • 2002
  • This article is focused on the research for the system design that isolate noxious data from internet for juveniles Normally, by motivating this software which was designed to isolate noxious data, harmful data was deleted or graded But these normal process contains a lot of complexity, for example, essential continual upgrade, grading mistake, etc. So, to solve these fallacy, word-weighting process, where several harmful words which can be optained in internet site are discriminance and weighted, is utilized by using AC machine. At the result, the isolation rate of harmful site rose up to 90%, which means this process is greatly efficient.

  • PDF

Conformer with lexicon transducer for Korean end-to-end speech recognition (Lexicon transducer를 적용한 conformer 기반 한국어 end-to-end 음성인식)

  • Son, Hyunsoo;Park, Hosung;Kim, Gyujin;Cho, Eunsoo;Kim, Ji-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.5
    • /
    • pp.530-536
    • /
    • 2021
  • Recently, due to the development of deep learning, end-to-end speech recognition, which directly maps graphemes to speech signals, shows good performance. Especially, among the end-to-end models, conformer shows the best performance. However end-to-end models only focuses on the probability of which grapheme will appear at the time. The decoding process uses a greedy search or beam search. This decoding method is easily affected by the final probability output by the model. In addition, the end-to-end models cannot use external pronunciation and language information due to structual problem. Therefore, in this paper conformer with lexicon transducer is proposed. We compare phoneme-based model with lexicon transducer and grapheme-based model with beam search. Test set is consist of words that do not appear in training data. The grapheme-based conformer with beam search shows 3.8 % of CER. The phoneme-based conformer with lexicon transducer shows 3.4 % of CER.

A Phoneme-based Approximate String Searching System for Restricted Korean Character Input Environments (제한된 한글 입력환경을 위한 음소기반 근사 문자열 검색 시스템)

  • Yoon, Tai-Jin;Cho, Hwan-Gue;Chung, Woo-Keun
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.10
    • /
    • pp.788-801
    • /
    • 2010
  • Advancing of mobile device is remarkable, so the research on mobile input device is getting more important issue. There are lots of input devices such as keypad, QWERTY keypad, touch and speech recognizer, but they are not as convenient as typical keyboard-based desktop input devices so input strings usually contain many typing errors. These input errors are not trouble with communication among person, but it has very critical problem with searching in database, such as dictionary and address book, we can not obtain correct results. Especially, Hangeul has more than 10,000 different characters because one Hangeul character is made by combination of consonants and vowels, frequency of error is higher than English. Generally, suffix tree is the most widely used data structure to deal with errors of query, but it is not enough for variety errors. In this paper, we propose fast approximate Korean word searching system, which allows variety typing errors. This system includes several algorithms for applying general approximate string searching to Hangeul. And we present profanity filters by using proposed system. This system filters over than 90% of coined profanities.

The Processing of Irregular Verbals in Korean : Shown in Aphasics (한국어 불규칙 용언의 형태 정보 : 실어증 환자를 중심으로)

  • 김윤정;김수정;김희정;남기춘
    • Proceedings of the Korean Society for Cognitive Science Conference
    • /
    • 2000.05a
    • /
    • pp.303-308
    • /
    • 2000
  • 용언은 그 어간이 여러 문법소와 결합하면서 자동적 음운 변동을 제외한 형태 변동이 있는가, 없는가에 의해 규칙 용언/불규칙 용언으로 구분할 수 있다. 이러한 불규칙 용언은 심성 어휘집에 어떤 형태로 저장되어 있으며, 규칙 용언과는 어떠한 관계가 있는지, 나아가 실어증 환자의 경우에는 정상인에 비해 어떤 행동장애를 보이며, 장애가 있다면 어느 경로의 손상으로 인한 장애인지를 알아보는 것이 본 연구의 목적이다. 이를 위해 이해성 실어증 환자 한 명과 음어적 실행증 현상을 동반한 경미한 정도의 실어증 환자를 피험자로 하였다. 실험 과제는 단어 채워 넣기 과제(word completion task)를 사용하였다. 즉 주어진 기본형 용언을 검사 문장의 문맥에 맞게 활용하여 채워 넣는 것이다. 실험 결과에 의하면 환자들은 규칙용언의 활용(예. 먹다/먹는)과 불규칙 용언 중 형태를 유지한 채로 활용하는 경우(예. 줍다/줍고)에는 거의 오류가 없었으나, 불규칙 용언이 형태 변화를 겪어야 할 경우(예. 줍다/주워)에는 대부분 오류를 보였다. 또 이때는 기본형(basic form)을 그대로 유지하는 오류 방향성을 관찰할 수 있었다. 이는 그간 문법으로 구분되어 오던 규칙 용언/불규칙 용언의 정보 처리보다는 형태 유지/형태 변화 정보 처리의 영향이 크다는 것을 알 수 있다. 특히 이해성 실어증 환자는 전체적인 오류율이 매우 높았는데, 규칙 용언의 경우에도 오류를 보였다. 이때, 용언의 어간에 해당하는 부분에는 오류가 없고, 뒤에 따르는 내용과의 관계를 파악해야 하는 문법 기능소, 즉 연결 어미에서 오류를 보여 정보의 유지, 통합에 문제가 있다는 기존의 연구와도 일치하는 결과를 나타냈다.환자는 시제 선어말 어미를 선택하는데도 어려움을 보임이 확인되었다. 실험 3 역시 실험 1과 실험2에서와 동일하게 처리의 어려움을 보였다. 이러한 실험 결과들은 국어의 존칭과 시제 선어말 어미가 통사부에서 구(XP)와 결합하여 새로운 구를 형성하는 통사적 접사로 해석할 수 있으며 Grodzinsky의 가설을 지지하는 결과를 보여 줌으로서 국어에서도 AgrP, TP, CP 사이의 통사적 위계가 있음을 뒷받침하는 증거가 된다.전처리한 Group 3에서는 IL-2와 IL-4의 수준이 유의성있게 억제되어 발현되었다 (p < 0.05). 이러한 결과를 통하여 T. denticola에서 추출된 면역억제 단백질이 Th1과 Th2의 cytokine 분비 기능을 억제하는 것으로 확인 되었으며 이 기전이 감염 근관에서 발견되는 T. denticola의 치수 및 치근단 질환에 대한 병인기전과 관련이 있는 것으로 사료된다.을 보였다. 본 실험 결과, $Depulpin^{\circledR}은{\;}Tempcanal^{\circledR}와{\;}Vitapex^{\circledR}$에 비해 높은 세포 독성을 보여주공 있으나, 좀 더 많은 임상적 검증이 필요할 것으로 사료된다.중요한 역할을 하는 것으로 추론할 수 있다.근관벽을 처리하는 것이 필요하다고 사료된다.크기에 의존하며, 또한 이러한 영향은 $(Ti_{1-x}AI_{x})N$ 피막에 존재하는 AI의 함량이 높고, 초기에 증착된 막의 업자 크기가 작을 수록 클 것으로 여겨진다. 그리고 환경의 의미의 차이에 따라 경관의 미학적 평가가 달라진 것으로 나타났다.corner$적 의도에 의한 경관구성의 일면을 확인

  • PDF

A Composite Study on the Writing Characteristics of Korean Learners - Focused on Syntax Production, Syntax Complexity and Syntax Errors (한국어 학습자의 쓰기 특성에 관한 융복합적 연구 - 구문산출성, 구문복잡성 및 구문오류를 중심으로)

  • Lee, MI Kyung;Noh, Byungho
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.11
    • /
    • pp.315-324
    • /
    • 2018
  • For Korean learners, writing is a harder part than any other areas in Korean languages. But in the future, the ability to organize and write systematically is essential for future koran languages learners to take classes, do assignments and presentations at school, and then adapt to job situations. Therefore, there is a need to devise a direction for this. In general, writing characteristics are viewed in many ways, including writing productivity, writing complexity, and writing errors. Accordingly, the study provided drawings and A4 paper for Vietnamese Korean learners, Chinese Korean learners, and Korean university students, before writing freely. Based on the their writing results, we looked at syntax factors (total C-units, total number of words), syntax complexity (number of words per C-unit and clause density), and writing errors (postposition, spell errors, and connective suffix, space errors) According to the study, Vietnamese and Chinese Korean language learners showed significantly lower syntax productivity and complexity than Korean university students, and showed more writing errors than Korean students in postposition and clause density. Based on the results of the study, we discussed writing guidelines for Korean languages learners. However, this study did not validate the differences in writing characteristics according to the Korean language level and length of residences for the study subjects. Therefore, it is necessary to consider this in future research.

Efficient Keyword Extraction from Social Big Data Based on Cohesion Scoring

  • Kim, Hyeon Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.10
    • /
    • pp.87-94
    • /
    • 2020
  • Social reviews such as SNS feeds and blog articles have been widely used to extract keywords reflecting opinions and complaints from users' perspective, and often include proper nouns or new words reflecting recent trends. In general, these words are not included in a dictionary, so conventional morphological analyzers may not detect and extract those words from the reviews properly. In addition, due to their high processing time, it is inadequate to provide analysis results in a timely manner. This paper presents a method for efficient keyword extraction from social reviews based on the notion of cohesion scoring. Cohesion scores can be calculated based on word frequencies, so keyword extraction can be performed without a dictionary when using it. On the other hand, their accuracy can be degraded when input data with poor spacing is given. Regarding this, an algorithm is presented which improves the existing cohesion scoring mechanism using the structure of a word tree. Our experiment results show that it took only 0.008 seconds to extract keywords from 1,000 reviews in the proposed method while resulting in 15.5% error ratio which is better than the existing morphological analyzers.

Feature Generation of Dictionary for Named-Entity Recognition based on Machine Learning (기계학습 기반 개체명 인식을 위한 사전 자질 생성)

  • Kim, Jae-Hoon;Kim, Hyung-Chul;Choi, Yun-Soo
    • Journal of Information Management
    • /
    • v.41 no.2
    • /
    • pp.31-46
    • /
    • 2010
  • Now named-entity recognition(NER) as a part of information extraction has been used in the fields of information retrieval as well as question-answering systems. Unlike words, named-entities(NEs) are generated and changed steadily in documents on the Web, newspapers, and so on. The NE generation causes an unknown word problem and makes many application systems with NER difficult. In order to alleviate this problem, this paper proposes a new feature generation method for machine learning-based NER. In general features in machine learning-based NER are related with words, but entities in named-entity dictionaries are related to phrases. So the entities are not able to be directly used as features of the NER systems. This paper proposes an encoding scheme as a feature generation method which converts phrase entities into features of word units. Futhermore, due to this scheme, entities with semantic information in WordNet can be converted into features of the NER systems. Through our experiments we have shown that the performance is increased by about 6% of F1 score and the errors is reduced by about 38%.