HMM and Natural Language Parsing 26 pointsT/F Questions 2 points each TF 1. In a

Question

HMM and Natural Language Parsing 26 pointsT/F Questions 2 points each TF 1. In a first-order MM, the probability of a state at t, is a function of the state at ti. T F 2. The Forward algorithm solves the evaluation problem for HMMs. (That is, it determines which HMM is the best fit for the data.) TF 3. English is a finite language. T F 4. English is not a regular language. T F 5. For a context-free grammar G to have the weak generative capacity for a language L, G must be able to generate every string in L. 6. For a context-free grammar G to have the strong generative capacity for a language L, G must have the weak generative capacity for L, plus T F be able to generate each string in L with multiple derivations.

Explanation / Answer

1. True (As in first order Markov model he state variables at current state(t2) depends on the previous state variables(t1).

2.True(There are three problems associated with Hiden Markov Models : Evaluation,Decoding and Learning. Forward algorithm is a method which we can use to solve the evaluation problem of HMMs,we can solve this problem through simple probability also but it will prove to be a complex method so we can use forward algorithm for this purpose)

3.False(As english is an infinite language)

4.False(As English is an infinite language,it can't be regular.Because an infinite language can't be a regular one)

5.True(Context free grammar G having weak generative capacity is defined as the set of the strings of language L,which CFG 'G' generates)

6.True(CFG having strong generative capacity use parse tree to represent the language as well as generate it also at the same time)

1. True

2.True

3.True(As if the languages are accepted by Deterministic pda then they are accepted by non deterministic pda also)

5.True(As |vy|>=1)

6.True(As |uxz|<=n,where n is the length of the string and n>=1)

7.True

8.True

9.False

10.False(LHS of a CFG consists of a single non terminal symbol)

11.True

12.False(CFGs permit recursion, For example in case of a palindrome number)

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.