Artificial Intelligence Interview Questions
- Home >> Category >> Programming MCQs >> Artificial Intelligence Interview Questions >> Which of the following is demerits of Top-Down Parser?
- « Previous
- Next »
Q.Which of the following is demerits of Top-Down Parser?
a. It is hard to implement.
b. Slow speed
c. inefficient
d. Both B and C
ANSWER: See Answer
It is inefficient, as the search process has to be repeated if an error occurs and Slow speed of working are Demerits of Top-Down Parser.
- « Previous
- Next »
NLP MCQ
- Admin
- NLP MCQ Questions
- NLP MCQ PDF
- Follow
- Take Nlp Quiz
Latest MCQ Tests
C Programming MCQ07th Jan, 2022
Advanced Java MCQ26th Nov, 2021
Tableau MCQ28th Jul, 2021
Power BI MCQ28th Jul, 2021
VLSI Design MCQ28th Jul, 2021
Digital Signal Processing MCQ28th Jul, 2021
Neural Networks MCQ28th Jul, 2021
Cryptography MCQ28th Jul, 2021
Real Time Operating System MCQ28th Jul, 2021
Data Warehouse MCQ16th Jul, 2021
Pratice HR Questions
Illegal Interview Questions17th Apr, 2021
Tough Interview Questions17th Apr, 2021
Group Interview Questions17th Apr, 2021
Stress Interview Questions17th Apr, 2021
Exit interview Questions17th Apr, 2021
Phone Interview Questions26th Jun, 2021
Nlp questions and answers mcq
Nlp questions and answers mcq maximum
-
AI - Natural Language Processing
Advertisements
Previous Page
Next Page
Natural Language Processing [NLP] refers to AI method of communicating with an intelligent systems using a natural language such as English.
Processing of Natural Language is required when you want an intelligent system like robot to perform as per your instructions, when you want to hear decision from a dialogue based clinical expert system, etc.
The field of NLP involves making computers to perform useful tasks with the natural languages humans use. The input and output of an NLP system can be −
- Speech
- Written Text
Classification of Top Down Parsers
Parsing is classified into two categories, i.e. Top-Down Parsing, and Bottom-Up Parsing. Top-Down Parsing is based on Left Most Derivation whereas Bottom-Up Parsing is dependent on Reverse Right Most Derivation.
The process of constructing the parse tree which starts from the root and goes down to the leaf is Top-Down Parsing.
- Top-Down Parsers constructs from the Grammar which is free from ambiguity and left recursion.
- Top-Down Parsers uses leftmost derivation to construct a parse tree.
- It allows grammar that is free from Left Factoring.
Video liên quan