Scholarlink

In this paper, we describe a symbolic model for the automatic orthographic unification of Nawatl text documents. Our model is based on algorithms that we have previously used to analyze sentences in Nawatl, and on the corpus called \(\pi \) -yalli, consisting of texts in several Nawatl orthographies. Our automatic unification algorithm implements linguistic rules in symbolic regular expressions. We also present a manual evaluation protocol that we have proposed and implemented to assess the quality of the unified sentences generated by our algorithm, by testing in a sentence semantic task. We have obtained encouraging results from the evaluators for most of the desired features of our artificially unified sentences.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Symbolic Algorithm for the Unification of Nawatl Word Spellings

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Juan-José Guzman-Landa,
  • Jesús Vázquez-Osorio,
  • Juan-Manuel Torres-Moreno,
  • Ligia Quintana Torres,
  • Miguel Figueroa-Saavedra,
  • Martha-Lorena Avendaño-Garrido,
  • Graham Ranger,
  • Patricia Velázquez-Morales,
  • Gerardo Sierra-Martínez

摘要

In this paper, we describe a symbolic model for the automatic orthographic unification of Nawatl text documents. Our model is based on algorithms that we have previously used to analyze sentences in Nawatl, and on the corpus called \(\pi \) -yalli, consisting of texts in several Nawatl orthographies. Our automatic unification algorithm implements linguistic rules in symbolic regular expressions. We also present a manual evaluation protocol that we have proposed and implemented to assess the quality of the unified sentences generated by our algorithm, by testing in a sentence semantic task. We have obtained encouraging results from the evaluators for most of the desired features of our artificially unified sentences.