본문 바로가기
  • Home

Searching Similar Example-Sentences Using the Needleman-Wunsch Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2006, 11(4), pp.181-188
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

김동주 1 KIM HAN WOO 1

1한양대학교

Candidate

ABSTRACT

In this paper, we propose a search algorithm for similar example-sentences in the computer-aided translation. The search for similar examples, which is a main part in the computer-aided translation, is to retrieve the most similar examples in the aspect of structural and semantical analogy for a given query from examples. The proposed algorithm is based on the Needleman-Wunsch algorithm, which is used to measure similarity between protein or nucleotide sequences in bioinformatics. If the original Needleman-Wunsch algorithm is applied to the search for similar sentences, it is likely to fail to find them since similarity is sensitive to word's inflectional components. Therefore, we use the lemma in addition to (typographical) surface information. In addition, we use the part-of-speech to capture the structural analogy. In other word, this paper proposes the similarity metric combining the surface, lemma, and part-of-speech information of a word. Finally, we present a search algorithm with the proposed metric and present pairs contributed to similarity between a query and a found example. Our algorithm shows good performance in the area of electricity and communication.

Citation status

* References for papers published after 2022 are currently being built.