other,21-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,10-1-C94-1030,ak In <term> optical character recognition </term> and <term> continuous speech recognition </term> of a <term> natural language </term> , it has been difficult to detect <term> error characters </term> which are wrongly deleted and inserted .
other,25-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,27-3-C94-1030,ak From the results of the experiments , it is concluded that the methods is useful for detecting as well as correcting these errors in <term> Japanese bunsetsu </term> and <term> English words </term> .
other,50-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
tech,5-1-C94-1030,ak In <term> optical character recognition </term> and <term> continuous speech recognition </term> of a <term> natural language </term> , it has been difficult to detect <term> error characters </term> which are wrongly deleted and inserted .
other,12-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,19-1-C94-1030,ak In <term> optical character recognition </term> and <term> continuous speech recognition </term> of a <term> natural language </term> , it has been difficult to detect <term> error characters </term> which are wrongly deleted and inserted .
other,46-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
tech,1-1-C94-1030,ak In <term> optical character recognition </term> and <term> continuous speech recognition </term> of a <term> natural language </term> , it has been difficult to detect <term> error characters </term> which are wrongly deleted and inserted .
other,24-3-C94-1030,ak From the results of the experiments , it is concluded that the methods is useful for detecting as well as correcting these errors in <term> Japanese bunsetsu </term> and <term> English words </term> .
other,62-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,64-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
measure(ment),55-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,8-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
other,32-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
tech,40-2-C94-1030,ak In order to judge three types of the <term> errors </term> , which are <term> characters </term> wrongly substituted , deleted or inserted in a <term> Japanese bunsetsu </term> and an <term> English word </term> , and to correct these <term> errors </term> , this paper proposes new methods using <term> m-th order Markov chain model </term> for <term> Japanese kanji-kana characters </term> and <term> English alphabets </term> , assuming that <term> Markov probability </term> of a correct chain of <term> syllables </term> or <term> kanji-kana characters </term> is greater than that of erroneous chains .
hide detail