COMPUTATIONAL ANALYSIS OF SUFFIXES AND BOUND STEMS OF THE GREEK LANGUAGE: A CRASH TEST WITH LINGUISTICA
This paper attempts to participate in the ongoing discussion in search of a suitable model for the computational treatment of Greek morphology. Focusing on the unsupervised morphology learning technique, and particularly on the model of Linguistica by Goldsmith (2001), we attempt a computational tre...
Κύριοι συγγραφείς: | , |
---|---|
Μορφή: | Online |
Γλώσσα: | English |
Έκδοση: |
CENTRE OF MODERN GREEK DIALECTS, DEPARTMENT OF PHILOLOGY, UNIVERSITY OF PATRAS
2010
|
Θέματα: | |
Διαθέσιμο Online: | https://pasithee.library.upatras.gr/pwpl/article/view/21 |