Una codificación prefija para un idioma artificial


Autoria(s): Ortega Toro, José Antonio
Contribuinte(s)

Lenguajes y Ciencias de la Computación

Vico Vela, Francisco José

Data(s)

27/06/2016

27/06/2016

01/09/2015

27/06/2016

Resumo

This work focuses in the formal and technical analysis of some aspects of a constructed language. As a first part of the work, a possible coding for the language will be studied, emphasizing the pre x coding, for which an extension of the Hu man algorithm from binary to n-ary will be implemented. Because of that in the language we can't know a priori the frequency of use of the words, a study will be done and several strategies will be proposed for an open words system, analyzing previously the existing number of words in current natural languages. As a possible upgrade of the coding, we'll take also a look to the synchronization loss problem, as well as to its solution: the self-synchronization, a t-codes study with the number of possible words for the language, as well as other alternatives. Finally, and from a less formal approach, several applications for the language have been developed: A voice synthesizer, a speech recognition system and a system font for the use of the language in text processors. For each of these applications, the process used for its construction, as well as the problems encountered and still to solve in each will be detailed.

Identificador

http://hdl.handle.net/10630/11653

Idioma(s)

eng

Direitos

info:eu-repo/semantics/openAccess

Palavras-Chave #Grado en Ingeniería Informática - Trabajos Fin de Grado #Informática - Trabajos Fin de Grado #Codificación, Teoría de la #Voz - Reconocimiento automático #Coding theory #Prefix code #Huffman coding #Speech recognition #Voice synthesization
Tipo

info:eu-repo/semantics/bachelorThesis