http://www.cnr.it/ontology/cnr/individuo/prodotto/ID209886

A Graph-Oriented Implementation of a Grapheme-to-Phoneme Transcriber for Italian (Articolo in rivista)

Type

Prodotto della ricerca (Classe)
Articolo in rivista (Classe)

Label

A Graph-Oriented Implementation of a Grapheme-to-Phoneme Transcriber for Italian (Articolo in rivista) (literal)

Anno

1987-01-01T00:00:00+01:00 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

10.1016/0167-6393(87)90026-4 (literal)

Alternative label

Cosi P. (1987)
A Graph-Oriented Implementation of a Grapheme-to-Phoneme Transcriber for Italian
in Speech communication (Print); Elsevier, Amsterdam (Paesi Bassi)
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Cosi P. (literal)

Pagina inizio

203 (literal)

Pagina fine

216 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url

http://www.sciencedirect.com/science/article/pii/0167639387900264 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

6 (literal)

Rivista

Speech communication (Rivista)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali

14 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo

3 (literal)

Note

Elsev (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

P Cosi Centro di Studio per le Ricerche di Fonetica, C.N.R., 35122 Padova, Italy (now ISTC CNR - UOS Padova) (literal)

Titolo

A Graph-Oriented Implementation of a Grapheme-to-Phoneme Transcriber for Italian (literal)

Abstract

A graph-oriented computational approach to the grapheme-to-phoneme transcription of Italian written texts is described. The letter-to-sound transcription rule system is built up taking into account the implicit phonotactic constraints of the Italian language. The system follows the mathematical model called Finite States Automata (FSA), which is generalized and augmented to obtain a simple syntax-directed translation schema. The whole set of rules described and implemented is often associated with a particular set of exceptions. These rules are entirely based on the pure orthographic form of the words, and no level of grammatical knowledge of their classes is considered. After describing the rules in their traditional notation and formalism, we consider both the graph-oriented point of view relative to the transcriber implementation and some examples of the transcription procedure. Finally, the advantages and disadvantages of the graph-oriented approach will be shown and discussed, together with future trends and improvements. (literal)
Nous décrivons une méthode de transcription graphèmes/phonèmes de textes écrits en italien. Notre approche s'appuye sur la théorie mathématique des graphes. Le système de règles est construit au fur et à mesure en tenant compte des constraintes phonotactiques implicites de l'italien. Le système est organisé conformément au modèle mathématique des automates finis, qui a été généralisé et complété afin d'obtenir un schéma simple de traduction syntaxiquement orienté. Une gestion des exceptions compléte l'ensemble des règles implantées. Ces règles font appel à l'orthographe du mot. Aucune information supplémentaire relative à leur appartenance à une classe grammaticale n'est donnée. Nous décrivons d'abord les règles à l'aide de la notation classique, ensuite du point de vue de leur implantation sous forme de graphes. Nous donnons quelques exemples de la procédure de transcription. Enfin, nous discutons les avantages et désavantages d'une approche faisant appel à la théorie mathématique des graphes ainsi que les développements futurs possibles. (literal)

Editore