Question

Suppose there are 3 characters in a language L, and we have built a unigram model....

  1. Suppose there are 3 characters in a language L, and we have built a unigram model. The probabilities for the 3 characters are given by the models are P(“A”) = 0.25, P(“B”) = 0.50, and P(“C”) = 0.25. What will be the expression to calculate the perplexity of for the sequences “AAA” and “ABA”?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

perplexity of sequence is given by following formula :

P(S) = ( 1 / (p(s1)p(s2)..p(sn)) )(1/n)

(i) For S1 = "AAA", perplexity is :

      ( 1 / ( 0.25 * 0.25 * 0.25 ) )(1/3)

      ( 1 / 0.25 ) =   4

     Perplexity for sequence "AAA" is 4

(ii) For S2 = "ABA", perplexity is :

      ( 1 / ( 0.25 * 0.5 * 0.25 ) )(1/3)

      ( 1 / 0.31498 ) =   3.1748

     Perplexity for sequence "ABA" is 3.1748

Note: If you have any doubts please comment.

It will be great help If you like.

Add a comment
Know the answer?
Add Answer to:
Suppose there are 3 characters in a language L, and we have built a unigram model....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Suppose that we have a language L dened over the alphabet {a, b, c} and suppose...

    Suppose that we have a language L dened over the alphabet {a, b, c} and suppose that L is context-free. We define a new language pm(L) to be the setof all permutations of all words in L. For example, if L = {abc, aab} then pm(L) = {abc, acb, bac, bca, cab, cba, aab, aba, baa}. Show that pm(L) need not be context-free by giving an example of a language L that is context-free but where pm(L) is not context-free.

  • A. Suppose that we have the state l) 2-1/2 (1010)1100)). How many (and which) particles are b. Su...

    a. Suppose that we have the state l) 2-1/2 (1010)1100)). How many (and which) particles are b. Suppose instead that we have the state l) 212(l000) |111). How many (and which) c. Suppose you measure the first particle from part (b) in the |0), |1) basis. What are the possible entangled? Explain why. particles are entangled? Explain why outcomes and their probabilities? On average, how many particles are entangled after the เงื่ measurement? a. Suppose that we have the state...

  • 6) Transmissions for a given model of car are built in 3 different factories. It is...

    6) Transmissions for a given model of car are built in 3 different factories. It is determined that: . Factory A produces 32% of the transmissions used, and 1 in 178 are defective. . Factory B produces 41% of the transmissions used, and 1 in 220 are defective. . Factory C produces 27% of the transmissions used, and l in 204 are defective. If a randomly selected car has a defective transmission, what is the probability the transmission was built...

  • Problem 1 Using what we have leamed in chapter 1, derive, for a semiconductor, the expressions of...

    Problem 1 Using what we have leamed in chapter 1, derive, for a semiconductor, the expressions of The total current density Conductivity - Problem 2 Consider Germanium sample with the following characteristics the electron and hole mobility for Ge is 0.39 and 0.19 m2N.s The electron and hole effectives masses are 0.56me and 0.4 me The energy gap is 0.67 eV at T-27°C 1) 2) Find the intrinsic carrier concentration for Ge What is the resistivity of the Ge sample...

  • 3. [20 Points] Assume that we have the Hidden Markov Model (HMM) depicted in the figure below [4 Points] If each of the...

    3. [20 Points] Assume that we have the Hidden Markov Model (HMM) depicted in the figure below [4 Points] If each of the states can take on k different values and a total of m a. possible (across all states), how many parameters are different observations are required to fully define this HMM? Justify your answer b. [4 Points] What conditional independences hold in this HMM? Justify your answer [12 Points] Suppose that we have binary states (labeled A and...

  • 3. Scale model (15 points). Suppose we wanted to make a scale model of the Earth...

    3. Scale model (15 points). Suppose we wanted to make a scale model of the Earth and the Moon, in which the Earth was the size of an exercise ball (-65 cm in diameter) a) (5pt) How far (in m) from the center of the Earth would the center of the Moon be on this b) (5pt) What would be the diameter (in cm) of the Moon on this scale? scale? c) (5pt) The orbit of Ex Alta-1 (cubesat built...

  • Let S = {a,b,c}. Write a context-free grammar for the language: L = {ba" wa" :n...

    Let S = {a,b,c}. Write a context-free grammar for the language: L = {ba" wa" :n > 0, we * and w contains bbc} BIU A- A - IX E ** 11 xX, T T: 12pt You Tube P S-baSaA AaA DACA bbc

  • Let ?= (a, b). The Language L = {w E ?. : na(w) < na(w)) is...

    Let ?= (a, b). The Language L = {w E ?. : na(w) < na(w)) is not regular. (Note: na(w) and nu(w) are the number of a's and 's in tw, respectively.) To show this language is not regular, suppose you are given p. You now have complete choice of w. So choose wa+1, Of course you see how this satisfies the requirements of words in the language. Now, answer the following: (a) What is the largest value of lryl?...

  • Question 2 1 pts Suppose that we wish to built the following multiple regression model: Ý;...

    Question 2 1 pts Suppose that we wish to built the following multiple regression model: Ý; = ßo + Ê, Xi1 + ,Xj2 where Y = mathematics exam score, X 1 =number of hours spent studying, X 2 =number of hours spent playing video games. Suppose we know that the number of hours spent studying is directly inversely proportional to the number of hours spend playing video games. Which of the following would be true, We cannot obtain the coefficients...

  • Suppose we have three programs aaa, bbb, ccc which are already developed, compiled and ready to...

    Suppose we have three programs aaa, bbb, ccc which are already developed, compiled and ready to execute. The first two, namely aaa and bbb, simply do some random amount of computation and write a character (respectively, 'A' and 'B to STDOUT_FILENO in a loop that is repeated 1000 times. If we run both programs at the same time, we might see different numbers of As and Bs such as AABBBAAABBBBABB. . . on the screen. The third program, namely ccc,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT