The aim of the present notes is to describe an algorithm for the syllabification of written Italian that has been developed at Laboratorio di Linguistica. The present algorithm is of deterministic type and it is based upon the use of recursion and of binary tree in order to detect the boundaries of the syllables within each word.
|Titolo:||An algorithm for the syllabification of written Italian|
|Data di pubblicazione:||1997|
|Appare nelle tipologie:||1.1 Articolo in rivista|