Sciweavers

15 search results - page 3 / 3
» Learning non-parametric models of pronunciation
Sort
View
ACL
2010
13 years 5 months ago
Combining Data and Mathematical Models of Language Change
English noun/verb (N/V) pairs (contract, cement) have undergone complex patterns of change between 3 stress patterns for several centuries. We describe a longitudinal dataset of N...
Morgan Sonderegger, Partha Niyogi
EMNLP
2008
13 years 8 months ago
Latent-Variable Modeling of String Transductions with Finite-State Methods
String-to-string transduction is a central problem in computational linguistics and natural language processing. It occurs in tasks as diverse as name transliteration, spelling co...
Markus Dreyer, Jason Smith, Jason Eisner
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
LREC
2010
190views Education» more  LREC 2010»
13 years 9 months ago
Applying a Dynamic Bayesian Network Framework to Transliteration Identification
Identification of transliterations is aimed at enriching multilingual lexicons and improving performance in various Natural Language Processing (NLP) applications including Cross ...
Peter Nabende
ACL
2008
13 years 9 months ago
Unsupervised Learning of Acoustic Sub-word Units
Accurate unsupervised learning of phonemes of a language directly from speech is demonstrated via an algorithm for joint unsupervised learning of the topology and parameters of a ...
Balakrishnan Varadarajan, Sanjeev Khudanpur, Emman...