The present invention discloses a Tibetan spelling check method and device based on automata, and relates to the field of natural language processing. The present invention is proposed to solve the problem in the prior art that as the application range is relatively narrow, some Tibetan characters with special structures cannot be recognized. The technical solution provided by the embodiments of the present invention includes: S10, segmenting a Tibetan text to be checked with an character as a unit to acquire at least one Tibetan character; S20, using the at least one Tibetan character as the input of a preset finite state automaton group; and S30, judging whether the Tibetan text to be checked is correctly spelled through the finite state automaton group.
展开▼
机译:本发明公开了一种基于自动机的藏文拼写检查方法及装置,涉及自然语言处理领域。提出本发明以解决现有技术的问题,因为其应用范围相对狭窄,一些具有特殊结构的藏文字符无法被识别。本发明实施例提供的技术方案包括:S 10 B>,以字符为单位分割待检查的藏文,以获取至少一个藏文。 S 20 B>,使用至少一个藏文字符作为预设的有限状态自动机群的输入;和S 30 B>,判断通过有限状态自动机组是否正确拼写了要检查的藏文。
展开▼