数组 – Golang：进程耗时太长.实施拼写检查

我用Go实现了一些Peter Norvig的拼写检查算法.

奇怪的是,FIRST THREE调用工作正确,给我所需的输出.

但从第二个方面来看,它说的是“过程花了太长时间”.

任何人都可以查看我的代码并告诉我出了什么问题？

这是可能出错的片段.

使用英文版的相同代码,一切都很完美.

UNICODE格式和边界根据语言而改变,因为英语每个字母@R_74_11262@个字节,在这种情况下亚洲语言包含每个字符3个字节.

这是尝试运行与英语完全相同的算法.
但这不起作用.

@R_706_10586@l_set := []String{}
for _,elem := range splits {

    if len(elem.str2) > 3 {
        //deletion
        @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+elem.str2[3:])

        //replace
        for i:=0; i<len(koreanletter)/3; i++ {
            @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(koreanletter[3*i:3*(i+1)])+elem.str2[3:])
        }

        //transpose
        if len(elem.str2) > 9 {
            @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(elem.str2[3:6])+String(elem.str2[:3])+elem.str2[9:])
        }

    } else {
        //deletion
        @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1)
    }

    //insertion
    for _,c := range koreanletter {
        @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(C)+elem.str2)
    }
    return RemoveDuplicateStringArrayForKorean(@R_706_10586@l_set)
}

英语的下面是.
这是完美的.

//Edits1 is to measure the distance between Strings.
func (model *Model) Edits1(word String) []String {
  const alphabet = "abcdefghijklmnopqrstuvwxyz"

  splits := []Pair{}
  for i := 0; i <= len(word); i++ {
    splits = append(splits,Pair{word[:i],word[i:]})
  }

  @R_706_10586@l_set := []String{}
  for _,elem := range splits {

    if len(elem.str2) > 0 {
      //deletion
      @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+elem.str2[1:])

      //replace
      for _,c := range alphabet {
        @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(C)+elem.str2[1:])
      }

      //transpose
      if len(elem.str2) > 1 {
        @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(elem.str2[1])+String(elem.str2[0])+elem.str2[2:])
      }

    } else {
      //deletion
      @R_706_10586@l_set = append(@R_706_10586@l_set,c := range alphabet {
      @R_706_10586@l_set = append(@R_706_10586@l_set,elem.str1+String(C)+elem.str2)
    }
  }
  return RemoveDuplicateStringArrayLowerCase(@R_706_10586@l_set)
}

增加：有序的论点,现在我有三件事可行.

韩国通讯中没有遗漏任何字符.

反正我是否可以更具体地看到错误？我只是想不通.