Podcast Episode

Teaching a Voice Engine to Say "Yalla" Right

My Weird Prompts

Episode 5982Oct 15, 202627 min

Who’s talking

3 speakers
Herman Poppleberry19 min · 72%
Corn6 min · 22%
Chatterbox1 min · 5%

1Transcript159 turns · 27 min

C
Chatterbox0:00

A sloth, a donkey, and a curious human. Send a prompt and see what they're doing. One hits a record with a question on his mind. Two brothers pick it up, see what they find. Corn takes his time, Herman's got the facts. Back and forth, they never hold back. My weird prompts, come on in, that's where we begin. My weird prompts, glad you're here.

C
Corn0:25

This episode was generated using artificial intelligence. Please verify facts. Hold on, say that again. You're telling me the word yalla has been going out over this feed pronounced like it rhymes with a shallow valley.

HP
Herman Poppleberry0:37

For months. Every time we said it, the voice treated it as an English word, which it's not. So it came out flat and wrong, and nobody told us.

C
Corn0:47

Nobody told us. He published a small model on Hugging Face, a token classifier that finds Hebrew words written in Latin letters sitting inside English sentences, and the reason he built it's this show. Herman, Daniel built a token classifier that finds Hebrew words written in Latin letters inside English sentences. That's the thing.

HP
Herman Poppleberry1:07

And then he asked the three questions underneath it. How does a model like that actually work? Why is spotting Romanized Hebrew harder than it sounds? And what does it take to get from we found the word to the voice engine saying it right?

C
Corn1:20

So let's start with the part that sounds simplest and isn't. What a token classifier is actually doing when it reads a sentence.

HP
Herman Poppleberry1:26

The name gives it away, and then it misleads you. Token classification gives a label to every token in the sentence. There's a real split at the heart of it. Finding the word is a classification problem. Saying the word is a grapheme, two phoneme problem, a phone set problem, a synthesis problem, and those aren't the same task wearing different hats. They're separate tasks with separate failure modes, and Daniel's model only solves the first one. That's not a criticism of the model. That's the shape of the whole field right now.

C
Corn1:54

So the detector gets us to the door. It doesn't get us inside.

HP
Herman Poppleberry1:58

Worse than that, it gets us to the door, and then we find out the door was the easy part. Best numbers I can find on the second half, even with a good detector sitting upstream, a monolingual English grapheme. Two phoneme model pronounces Romanized regional entities correctly about forty-one and a half percent of the time.

C
Corn2:15

Walk me through the split then.

HP
Herman Poppleberry2:17

Two stages. Stage one is detection. Find the Romanized Hebrew span, return its character offsets. Stage two is pronunciation. Turn that span into phonemes the voice engine will accept. Daniel's model is stage one, and it's the tidy part. With the mixed lingual front end and a lot of extra training data, that number rises to sixty-nine point six percent. A twenty-eight point absolute gain, which is enormous, and it still means nearly a third of the words come out wrong.

C
Corn2:45

So the model Daniel published is the part that works.

HP
Herman Poppleberry2:49

That's the honest metric. You can have a beautiful fun score and still produce a listening experience that makes a native speaker flinch, because a correctly detected span and a correctly pronounced word aren't the same achievement. That gap is the whole episode, really.

C
Corn3:04

There's also a personal stake here that

2Episode notes

Daniel built a small token classifier and published it on Hugging Face for one reason: this podcast kept mangling his second language. The model finds Hebrew words written in Latin letters inside English sentences so a voice engine can pronounce them properly. But spotting romanized Hebrew is harder than it sounds — there's no single transliteration standard, the vowels often aren't there to find, and words like chutzpah sit in a gray zone between two languages. This episode unpacks how token classification actually works, what span F1 of 0.941 on unseen words really means, and why a correctly detected word and a correctly pronounced word are two completely different achievements. Key sources: • Hugging Face — https://huggingface.co/docs/transformers/en/tasks/token_classification • Wikipedia — https://en.wikipedia.org/wiki/Hebrew_transliteration • arXiv 2610.16601v1 — https://arxiv.org/abs/2610.16601v1 Episode 5982 — myweirdprompts.com/n/5982 (permanent short link: myweirdprompts.com/204589)

Showing a preview — retrieve the full transcript via the Exa API.

Powered by the Exa API

See something wrong or missing on this page?