What are the algorithms to have efficient parsing?

What are the algorithms to have efficient parsing?
by

1 Answer

Answer :

i. Left to right parsing algorithm

 ii. Chart Parsing algorithm.

 iii. Left corner parsing
by

Related questions

Pick out the correct option about the types of parsing. a) Top-down and bottom-up parsing b) Interpretation and communication c) Roll-up and roll-down d) None of the mentioned

Description : Pick out the correct option about the types of parsing. a) Top-down and bottom-up parsing b) Interpretation and communication c) Roll-up and roll-down d) None of the mentioned

Last Answer : a) Top-down and bottom-up parsing

How many states are present in parsing? a) 1 b) 2 c) 3 d) 4

Description : How many states are present in parsing? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Last Answer : c) Transition Network

Define Bottom up parsing.

Description : Define Bottom up parsing.

Last Answer :  We start from the leaf nodes (i.e.) with the words and search for a tree with root S. 

Define Top down parsing.

Description : Define Top down parsing. 

Last Answer :  It starts with root node S and search for a tree that has the words as it leaves. 

What are the types of parsing?

Description : What are the types of parsing?

Last Answer : i. Top down parsing  ii. Bottom up parsing

Define Parsing.

Description : Define Parsing.

Last Answer : Parsing is the process of finding a parse tree for a given input string. It is also known as syntactic analysis.

Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Last Answer : a) True

____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Last Answer : a) Most-constrained variable

General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned

Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Last Answer : d) Less memory & Finds a solution in large infinite space

Distinguish between A* and AO* algorithms?

Description : Distinguish between A* and AO* algorithms?

Last Answer : Ans:- A* algorithm:-  A* uses a best-first search and finds the least-cost path from a given initial node to one goal node (out of one or more possible goals).  It uses a distance-plus- ... node as SOLVED.  If starting node is SOLVED or value greater than FUTILITY, stop, else repeat from 2.

Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Description : Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Last Answer : (a) i & ii only

Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Description : Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Last Answer : D. Neural Science and Genetic Science

n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. Decision support systems that contain an information base filled with the knowledge of an expert formulated in terms of if-then rules. D . None of these

Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these

Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.

Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base filled with the knowledge of an expert formulated in terms of if-then rules D . None of these

Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these

Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules

______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

What is Genetic Algorithms?

Description : What is Genetic Algorithms?

Last Answer : Genetic Algorithm is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

What are the 2 types of memory bounded heuristic algorithms?

Description : What are the 2 types of memory bounded heuristic algorithms?

Last Answer : i. Recursive Best First Search(RBFS)  ii. Memory bounded A*(MA*)

Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Description : Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Last Answer : B. Artificial neural networks 

Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned

Description : Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned

Last Answer : b) Constant space

DFS is ______ efficient and BFS is __________ efficient. a) Space, Time b) Time, Space c) Time, Time d) Space, Space

Description : DFS is ______ efficient and BFS is __________ efficient. a) Space, Time b) Time, Space c) Time, Time d) Space, Space

Last Answer : a) Space, Time

What are the two data structures that make IR systems efficient?

Description : What are the two data structures that make IR systems efficient?

Last Answer : i. Lexicon  ii.Inverted Index

How to setup Vision Helpdesk Two Way Email Parsing?

Description : How to setup Vision Helpdesk Two Way Email Parsing?

Last Answer : I do not, but I went to there website and I see that they have live support which is online right now. If you get frusturated with it I reccomend www.zendesk.com and http://www.jazzdesk.com/

Easy ICS Embedding / Parsing?

Description : Easy ICS Embedding / Parsing?

Last Answer : I’ve never used it but this looks like it might be useful? http://phpicalendar.net/documentation/index.php/Main_Page

Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right. (A) Leftmost derivation (B) Leftmost derivation traced out in reverse (C) Rightmost derivation traced out in reverse (D) Rightmost derivation

Description : Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right. (A) Leftmost derivation (B) Leftmost derivation traced out in reverse (C) Rightmost derivation traced out in reverse (D) Rightmost derivation

Last Answer : (A) Leftmost derivation

The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called .................. (A) Symbol resolution (B) Parsing (C) Assembly (D) Relocation

Description : The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called .................. (A) Symbol resolution (B) Parsing (C) Assembly (D) Relocation

Last Answer : (D) Relocation

Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Description : Which one from the following is false ? (A) LALR parser is Bottom - Up parser (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1). (C) LR parser is Bottom - Up parser. (D) In LL(1), the 1 indicates that there is a one - symbol look - ahead.

Last Answer : (B) A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).

Why is it easy to compose programs from algorithms ?

Description : Why is it easy to compose programs from algorithms ?

Last Answer : Answer : Algorithm gives a written plan of work in any corner. And if the work goes according to the plan, the work is completed smoothly. The work of the corner is divided into ... sequential method of solving problems in computers is called algorithm. So composing programs from algorithms is easy.

Did Early Indians invented mathematical algorithms that computer programmers use today to tell computers what to do?

Description : Did Early Indians invented mathematical algorithms that computer programmers use today to tell computers what to do?

Last Answer : No, they did not.

How many algorithms are there for sorting purpose and what are they?

Description : How many algorithms are there for sorting purpose and what are they?

Last Answer : There are many sorting algorithms however there are only a smallhandful that we actually use: insertion sort (stable) is typicallyused for small sets while large data sets primarily use heapsort(unstable ... sorting network, bitonic sorter, bogo sort, stooge sort,Han's algorithm, Thorup's algorithm.

What is the academic discipline that relies most heavily on algorithms for problem solving?

Description : What is the academic discipline that relies most heavily on algorithms for problem solving?

Last Answer : What is the answer ?

Which of the following is incorrect? Algorithms can be represented: a) as pseudo codes b) as syntax c) as programs d) as flowcharts

Description : Which of the following is incorrect? Algorithms can be represented: a) as pseudo codes b) as syntax c) as programs d) as flowcharts

Last Answer : Answer: b Explanation: Representation of algorithms: -As programs -As flowcharts -As pseudo codes

Which of the following is not true? A : For robotics, you should have a knowledge of different sensors B : For robotics, you must be able to write different planning algorithms C : For robotics, you may have to use actuators D : For robotics, you do not require help of computer engineers, mechanical

Description : Which of the following is not true? A : For robotics, you should have a knowledge of different sensors B : For robotics, you must be able to write different planning algorithms C : For robotics, you may have to use actuators D : For robotics, you do not require help of computer engineers, mechanical

Last Answer : D : For robotics, you do not require help of computer engineers, mechanical

Which of the following is not true? A : For robotics, you should have a knowledge of different sensors B : For robotics, you must be able to write different planning algorithms C : For robotics, you may have to use actuators D : For robotics, you do not require help of computer engineers, mechanical

Description : Which of the following is not true? A : For robotics, you should have a knowledge of different sensors B : For robotics, you must be able to write different planning algorithms C : For robotics, you may have to use actuators D : For robotics, you do not require help of computer engineers, mechanical

Last Answer : D : For robotics, you do not require help of computer engineers, mechanical

__________ do not take their decisions on measurements or estimates of the current traffic and topology. a. Static algorithms b. Adaptive algorithms c. Non - adaptive algorithms d. Recursive algorithms

Description : __________ do not take their decisions on measurements or estimates of the current traffic and topology. a. Static algorithms b. Adaptive algorithms c. Non - adaptive algorithms d. Recursive algorithms

Last Answer : c. Non - adaptive algorithms

Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Description : Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Last Answer : d. all of the mentioned

Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above

Description : Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above

Last Answer : d) All of the Above

A computer program consists of: a) System Flowchart b) Program Flowchart c) Algorithm's written in any computer language d) None of The Above

Description : A computer program consists of: a) System Flowchart b) Program Flowchart c) Algorithm's written in any computer language d) None of The Above

Last Answer : c) Algorithm's written in any computer language

Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above e) None of These

Description : Cryptography includes the __________to securely and consistently prevent or delay unauthorized access to sensitive information and enable verifiability of every component in a communication: a) Protocols b) Algorithms c) Strategies d) All of the Above e) None of These

Last Answer : d) All of the Above

State the differences between DIT and DIF algorithms.

Description : State the differences between DIT and DIF algorithms.

Last Answer : i. In DIT the input is in bit reversed order while the output is in normal order. In DIF the input is in normal order while the output is in bit reversed order. ii. Considering ... before the add subtract operation. While in DIF the complex multiplication takes place after the add subtract operation

what is meant by in place computations in DIT and DIF algorithms?

Description : what is meant by in place computations in DIT and DIF algorithms?

Last Answer : An algorithm in which same memory devices are used to store input and output data’s is known as in place computations in DIT and DIF algorithms.

The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Description : The methods or algorithms which are used to increase the performance of disk storage sub-system is called ............. A) Disk performing B) Disk scheduling C) Disk storing D) Disk extending

Last Answer : B) Disk scheduling

………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Description : ………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above

Last Answer : D) None of above

Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort