252 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author김한우-
dc.date.accessioned2019-08-01T05:13:12Z-
dc.date.available2019-08-01T05:13:12Z-
dc.date.issued2006-06-
dc.identifier.citation한국컴퓨터정보학회 2006년 하계학술발표논문집 및 학회지, v. 14, No. 1, Page. 197 - 204en_US
dc.identifier.issn1598-8481-
dc.identifier.urihttp://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE06536254&language=ko_KR-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/108086-
dc.description.abstract본 논문에서는 번역 지원 시스템을 위한 유사문장 검색 알고리즘을 제안한다. 이 알고리즘은 Needleman- Wunsch 알고리즘에 기반을 두고 있으며, 단어의 비교를 위해 단어의 표면어 정보, 표제어 정보, 품사 정보 계층으로 된 다층 정보의 융합을 통해 유사도를 계산하고 정렬을 수행하게 된다. 제안하는 알고리즘은 전기통신 분야의 문장 데이터에 대해 매우 우수한 검색 정확률을 보였다. This paper proposes an similar sentence searching algorithm for the computer-aided translation. The proposed algorithm, which is based on the Needleman-Wunsch algorithm, measures the similarity between the input sentence and the example sentences through combining surface, lemma, part-of-speech information of words with the multi-layered information . It also carries out the alignment between them. The accuracy of the proposed algorithm was very high in the experiment for the example sentences of the area of electricity and communication.en_US
dc.language.isoko_KRen_US
dc.publisher한국컴퓨터정보학회en_US
dc.subjectcomputer-aided translationen_US
dc.subjectNeedleman-Wunsch algorithmen_US
dc.subjecttranslation memoryen_US
dc.subjectalignmentsen_US
dc.title번역지원 시스템을 위한 유사 예문 검색en_US
dc.title.alternativeSearching Similar Example Sentences for the Computer-Aided Translation Systemen_US
dc.typeArticleen_US
dc.contributor.googleauthor김동주-
dc.contributor.googleauthor김한우-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF COMPUTING[E]-
dc.sector.departmentDIVISION OF COMPUTER SCIENCE-
dc.identifier.pidkimhw-
Appears in Collections:
COLLEGE OF COMPUTING[E](소프트웨어융합대학) > COMPUTER SCIENCE(소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE