Tibetan Spelling Check Method And Device Based On Automata

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.