Summary: We introduce some new classes of codes and we prove that their elements are the well known unbordered words. We recently proved that a finite code is circular if and only if it satisfies a property called $\Cal P$. Here, we show also that in the new classes we introduce here...
a dictionary that maps the suffix outputs to the one or more transliterated words; recognizing, by the computing device, an alternatively spelled transliterated word included in a document as one of the one or more correctly spelled transliterated words using the dictionary; and outputting, by the...