I need explination in details how did we calculate it   The Shannon Game intuition for perplexity - Josh Goodman: imagine a call-routing phone system gets120 Kcalls and has to recognize - "Operator" (let's say this occurs 1 in 4 calls) - "Sales" (1in 4) - "Technical Support" (1 in 4) - 30,000 different names (each name occurring 1 time in the 120K calls) We get the perplexity of this sequence of length120Kbyfirst multiplying120 Kprobabilities (90K of which are1/4and30 Kof which are1/120 K), nd then taking the inverse 120,000 th root: \[ \text { Perp }=\left(1 / 4 * 1 / 4 * 1 / 4 * 1 / 4 * 1 / 4 * \ldots .{ }^{*} 1 / 120 \mathrm{~K} * 1 / 120 \mathrm{~K} * \ldots .\right)^{\wedge}(-1 / 120 \mathrm{~K}) \] But this can be arithmetically simplified to justN=4: the operator(1/4), the sales(1/4), the tech support(1/4), and the 30,000 names(1/120,000): Perplexity=((1/4∗1/4∗1/4∗1/120 K)∧(−1/4)=52.6

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
I need explination in details how did we calculate it
 

The Shannon Game intuition for perplexity - Josh Goodman: imagine a call-routing phone system gets120 Kcalls and has to recognize - "Operator" (let's say this occurs 1 in 4 calls) - "Sales" (1in 4) - "Technical Support" (1 in 4) - 30,000 different names (each name occurring 1 time in the 120K calls) We get the perplexity of this sequence of length120Kbyfirst multiplying120 Kprobabilities (90K of which are1/4and30 Kof which are1/120 K), nd then taking the inverse 120,000 th root: \[ \text { Perp }=\left(1 / 4 * 1 / 4 * 1 / 4 * 1 / 4 * 1 / 4 * \ldots .{ }^{*} 1 / 120 \mathrm{~K} * 1 / 120 \mathrm{~K} * \ldots .\right)^{\wedge}(-1 / 120 \mathrm{~K}) \] But this can be arithmetically simplified to justN=4: the operator(1/4), the sales(1/4), the tech support(1/4), and the 30,000 names(1/120,000): Perplexity=((1/4∗1/4∗1/4∗1/120 K)∧(−1/4)=52.6
 
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Knowledge Booster
Greatest Common Divisor
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education