<?xml version="1.0" standalone="yes"?>
<Paper uid="C02-1001">
  <Title>Disambiguation of Finite-State Transducers</Title>
  <Section position="7" start_page="8" end_page="8" type="evalu">
    <SectionTitle>
4 Application and Results
</SectionTitle>
    <Paragraph position="0"> We will now apply our algorithm to transducers involved in speech recognition. Transducer D represents the pronunciation dictionary and possesses the fundamental property. The set of transitions of D is de ned as</Paragraph>
    <Paragraph position="2"> where f is the unique nal state ofD, 0 is the unique initial state of D, x is any symbol and # is a symbol representing the end of a word. All transitions t 2 E0 are such that i(t) 6= #. Any path in E 0 is acyclic. The transducer R representing a phonological rule is constructed to ful ll condition (C) of the fundamental theorem. The transducer D represents a French dictionary with 20000 words and their pronunciations. The transducer R represents the phonological rule that handles liaison in the French language. This liaison, which is represented by a phoneme appearing at the end of some words, must be removed when the next word begins with a consonant since the liaison phoneme is never pronounced in that case. However, if the next word begins with a vowel, the liaison phoneme may or may not be pronounced and thus becomes optional.</Paragraph>
    <Paragraph position="3">  handles this rule. In the gure, p denotes all phonemes, v the vowels and [x] the liaison phonemes.</Paragraph>
    <Paragraph position="4"> Table 1 shows the results of our algorithm using the dictionary and the phonological rule previously described.  dictionary As we can see in Table 1, the operator produces a smaller transducer in all the cases considered here.</Paragraph>
  </Section>
class="xml-element"></Paper>