• 제목/요약/키워드: N-best candidate selection

검색결과 6건 처리시간 0.02초

레벤스타인 거리에 기초한 위치 정확도를 이용한 고립 단어 인식 결과의 비유사 후보 단어 제외 (Exclusion of Non-similar Candidates using Positional Accuracy based on Levenstein Distance from N-best Recognition Results of Isolated Word Recognition)

  • 윤영선;강점자
    • 말소리와 음성과학
    • /
    • 제1권3호
    • /
    • pp.109-115
    • /
    • 2009
  • Many isolated word recognition systems may generate non-similar words for recognition candidates because they use only acoustic information. In this paper, we investigate several techniques which can exclude non-similar words from N-best candidate words by applying Levenstein distance measure. At first, word distance method based on phone and syllable distances are considered. These methods use just Levenstein distance on phones or double Levenstein distance algorithm on syllables of candidates. Next, word similarity approaches are presented that they use characters' position information of word candidates. Each character's position is labeled to inserted, deleted, and correct position after alignment between source and target string. The word similarities are obtained from characters' positional probabilities which mean the frequency ratio of the same characters' observations on the position. From experimental results, we can find that the proposed methods are effective for removing non-similar words without loss of system performance from the N-best recognition candidates of the systems.

  • PDF

고립 단어 인식 결과의 비유사 후보 단어 제외 성능을 개선하기 위한 다양한 접근 방법 연구 (Various Approaches to Improve Exclusion Performance of Non-similar Candidates from N-best Recognition Results on Isolated Word Recognition)

  • 윤영선
    • 말소리와 음성과학
    • /
    • 제2권4호
    • /
    • pp.153-161
    • /
    • 2010
  • Many isolated word recognition systems may generate non-similar words for recognition candidates because they use only acoustic information. The previous study [1,2] investigated several techniques which can exclude non-similar words from N-best candidate words by applying Levenstein distance measure. This paper discusses the various improving techniques of removing non-similar recognition results. The mentioned methods include comparison penalties or weights, phone accuracy based on confusion information, weights candidates by ranking order and partial comparisons. Through experimental results, it is found that some proposed method keeps more accurate recognition results than the previous method's results.

  • PDF

Opportunistic Multiple Relay Selection for Two-Way Relay Networks with Outdated Channel State Information

  • Lou, Sijia;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.389-405
    • /
    • 2014
  • Outdated Channel State Information (CSI) was proved to have negative effect on performance in two-way relay networks. The diversity order of widely used opportunistic relay selection (ORS) was degraded to unity in networks with outdated CSI. This paper proposed a multiple relay selection scheme for amplify-and-forward (AF) based two-way relay networks (TWRN) with outdated CSI. In this scheme, two sources exchange information through more than one relays. We firstly select N best relays out of all candidate relays with respect to signal-noise ratio (SNR). Then, the ratios of the SNRs on the rest of the candidate relays to that of the Nth highest SNR are tested against a normalized threshold ${\mu}{\in}[0,1]$, and only those relays passing this test are selected in addition to the N best relays. Expressions of outage probability, average bit error rate (BER) and ergodic channel capacity were obtained in closed-form for the proposed scheme. Numerical results and Simulations verified our theoretical analyses, and showed that the proposed scheme had significant gains comparing with conventional ORS.

Population Analysis of Iranian Potato virus Y Isolates Using Complete Genome Sequence

  • Pourrahim, Reza;Farzadfar, Shirin
    • The Plant Pathology Journal
    • /
    • 제32권1호
    • /
    • pp.33-46
    • /
    • 2016
  • In this study, the full-length nucleotide sequences of four Iranian PVY isolates belonging to $PVY^N$ strain were determined. The genome of Iranian PVY isolates were 9,703-9,707 nucleotides long encoding all potyviral cistrons including P1, HC-Pro, P3, 6K1, CI, 6K2, VPg, NIa-Pro, NIb and CP with coding regions of 825, 1,395, 1,095, 156, 1,902, 156, 564, 732, 1,557 and 801 nucleotides in length, respectively. The length of pipo, embedded in the P3 cistron, was 231 nucleotides. Phylogenetic analysis showed that the Iranian isolates clustered with European recombinant NTN isolates in the N lineage. Recombination analysis demonstrated that Iranian $PVY^N$ isolates had a typical European $PVY^{NTN}$ genome having three recombinant junctions while $PVY^N$ and $PVY^O$ were identified as the parents. We used dN/dS methods to detect candidate amino acid positions for positive selection in viral proteins. The mean ${\omega}$ ratio differed among different genes. Using model M0, ${\omega}$ values were 0.267 (P1), 0.085 (HC-Pro), 0.153 (P3), 0.050 (CI), 0.078 (VPg), 0.087 (NIa-pro), 0.079 (NIb) and 0.165 (CP). The analysis showed different sites within P1, P3 and CP were under positive selection pressure, however, the sites varied among PVY populations. To the best of our knowledge, our analysis provides the first demonstration of population structure of $PVY^N$ strain in mid-Eurasia Iran using complete genome sequences and highlights the importance of recombination and selection pressure in the evolution of PVY.

작업 스케쥴링 문제 해결을 위한 Branch & Bound 해법의 비교분석 (Heuristic Aspects of the Branch and Bound Procedure for a Job Scheduling Problem)

  • 고석주;이채영
    • 대한산업공학회지
    • /
    • 제18권2호
    • /
    • pp.141-147
    • /
    • 1992
  • This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6 ${\leq}$ n ${\leq}$ 4). Medium sized random problems (10 ${\leq}$ n ${\leq}$ 30) are also generated and examined. The computational results are compared and discussed for the three heuristics.

  • PDF

대용량 한국어 연속음성인식 시스템 개발 (On the Development of a Large-Vocabulary Continuous Speech Recognition System for the Korean Language)

  • 최인정;권오욱;박종렬;박용규;김도영;정호영;은종관
    • 한국음향학회지
    • /
    • 제14권5호
    • /
    • pp.44-50
    • /
    • 1995
  • 본 논문에서는 연속분포 HMM을 이용한 대용량 한국어 연속음성인식 시스템에 관하여 기술한다. 인식 시스템의 성능을 개선하기 위하여 음성 모델링 단위의 선정, 단어간 모델링, 탐색 알고리듬, 문법에 관하여 연구하였다. 기본 인식단위로 트라이존을 사용하며 학습성을 개선하고 기능어에서의 에러 발생을 줄이기 위하여 일반화된 트라이폰과 function word-de-pendent phone을 사용한다. 단어 사이에는 묵음 모델과 null transition을 사용하여 선택적으로 묵음을 추가하였다. 언어모델로는 단어 클래스에 근거한 word pair 문법과 bigram 모델이 이용된다. 또한 지식 정보들을 효율적으로 활용할 수 있도록 N개의 후보 문장들을 탐색할 수 있는 알고리듬을 구현하였다. 후처리기에서는 word triple문법을 사용하여 N개의 최적 문장을 재정렬하여 최종적인 인식 문장을 결정하며, 마지막으로 후치사와 관련된 사소한 에러들을 수정한다. 3천단어의 연속음성 데이타베이스에 대한 인식실험에서, 후처리로 word triple 문법을 사용하여 $93.1\%$의 단어 인식률과 $73.8\%$의 문장 인식률을 얻었다.

  • PDF