基于有限状态自动机的藏文音节组织研究  

Research on Tibetan syllable organization using finite state automata

作　　者：更桑吉 安见才让[1] Geng Sangji;Anjian Cairang(School of computer,Qinghai University for Nationalities,Xining,Qinghai 810007,China)

机构地区：[1]青海民族大学计算机学院,青海西宁810007

出　　处：《计算机时代》2021年第1期65-67,71,共4页Computer Era

基　　金：国家自然科学基金项目(61862054);青海省应用基础研究项目(2019-ZJ-7066)。

摘　　要：通过对藏文的字形特征、拼写规律,以及文法规则的分析和研究,实现藏文词语的实时检错。借助形式语言有限状态自动机的方法,对藏文字结构中的基字、前加字、上加字、下加字、后加字、再后加字之间的搭配规则设计了状态图和邻接矩阵。该方法提高了藏文文本质量,使原本复杂的书面语法规则变得简单直观,从而使符合现代藏文音节组织结构的词语能实时检错。该研究为实现藏文的自动校对提供了基础。By analyzing and studying the characteristics of Tibetan character,the spelling rule and grammar rule,the real-time error detection of Tibetan words is realized.With the help of finite state automata of formal language,this paper designs the state diagram and adjacency matrix for the matching rules among the basic characters,prefix letters,superfixed letters,subjoined letters,suffixed letters and up-adding characters in the Tibetan character structure.This method improves the quality of Tibetan text,makes the complex original written grammar rules simple and intuitive,so that the words in line with the modern Tibetan syllable organization structure can be error detected in real time.This research provides a basis for the realization of Tibetan automatic proofreading.

关 键 词：藏文 文法规则 有限状态自动机 校对 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]