What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned

What is Morphological Segmentation?

a) Does Discourse Analysis

b) Separate words into individual morphemes and identify the class of the morphemes

c) Is an extension of propositional logic

d) None of the mentioned
by

1 Answer

Answer :

b) Separate words into individual morphemes and identify the class of the morphemes
by

Related questions

Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned

Description : Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned

Last Answer : c) Extension of propositional logic

What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Description : What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic

Last Answer : c) Extension of propositional logic

Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned

Last Answer : c) Every sentence of first-order logic

What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Description : What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned

Last Answer : c) Both Objects & Relations

Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned

Last Answer : b) Word Sense Disambiguation

Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Description : Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic

Last Answer : a) ILP

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Description : What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly

Last Answer : a) Reduction to propositional logic, Manipulate rules directly

Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

Define AND –Elimination rule in propositional logic

Description : Define AND –Elimination rule in propositional logic

Last Answer : AND elimination rule states that from a given conjunction it is possible to inference any of the conjuncts. 

Define Modus Ponen’s rule in Propositional logic?

Description : Define Modus Ponen’s rule in Propositional logic?

Last Answer : The standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal is said to be Modus Ponen’s rule. 

What are the basic Components of propositional logic?

Description : What are the basic Components of propositional logic?

Last Answer : i. Logical Constants (True, False) 

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus 

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level 

Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Description : Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned

Last Answer : a) First-order definite clause are similar to propositional forward chaining

Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

Description : Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

Last Answer : b) Atomic sentences

Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Description : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned

Last Answer : d) All of the mentioned

What is the process of breaking an image into groups? a) Edge detection b) Smoothing c) Segmentation d) None of the mentioned

Description : What is the process of breaking an image into groups? a) Edge detection b) Smoothing c) Segmentation d) None of the mentioned

Last Answer : c) Segmentation

Which object recognition process is an error-prone process? a) Bottom-up segmentation b) Top-down segmentation c) Both Bottom-up & Top-down segmentation d) None of the mentioned

Description : Which object recognition process is an error-prone process? a) Bottom-up segmentation b) Top-down segmentation c) Both Bottom-up & Top-down segmentation d) None of the mentioned

Last Answer : a) Bottom-up segmentation

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Last Answer : a) True

Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False

Last Answer : a) True

What are the two sub problems in discourse understanding?

Description : What are the two sub problems in discourse understanding?

Last Answer : i. Reference Resolution  ii. The structure of coherent discourse.

Define Discourse understanding.

Description : Define Discourse understanding.

Last Answer :  A discourage is any string of language usually one that is more than one sentence long. 

Which one of the following groups of three animals each is correctly matched with their one characteristic morphological feature? Animals Morphological features (a) Scorpion, spider, – Ventral solid central cockroach nervous system (b) Cockroach, locust, – Metameric Taenia segmentation(c) Liver fluke, – Bilateral symmetry sea anemone, sea cucumber (d) Centipede, prawn, – Jointed appendages sea urchin

Description : Which one of the following groups of three animals each is correctly matched with their one characteristic morphological feature? Animals Morphological features (a) Scorpion, spider, - Ventral solid ... symmetry sea anemone, sea cucumber (d) Centipede, prawn, - Jointed appendages sea urchin

Last Answer : (a) Scorpion, spider, – Ventral solid central cockroach nervous system

Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

Description : Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

Last Answer : d) First-order definite clauses

____________ 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

______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Description : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Last Answer : d) All of the mentioned

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Description : The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned

Last Answer : d) All of the mentioned

Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

Description : Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

Last Answer : d) All of the mentioned

______ 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

______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Description : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned

Last Answer : d) All of the mentioned

Fuzzy logic is usually represented as a) IF-THEN-ELSE rules b) IF-THEN rules c) Both a & b d) None of the mentioned

Description : Fuzzy logic is usually represented as a) IF-THEN-ELSE rules b) IF-THEN rules c) Both a & b d) None of the mentioned

Last Answer : b) IF-THEN rules

When talking to a speech recognition program, the program divides each second of your speech into 100 separate __________ a) Codes b) Phonemes c) Samples d) Words

Description : When talking to a speech recognition program, the program divides each second of your speech into 100 separate __________ a) Codes b) Phonemes c) Samples d) Words

Last Answer : c) Samples

Speech Segmentation is a subtask of Speech Recognition. a) True b) False

Description : Speech Segmentation is a subtask of Speech Recognition. a) True b) False

Last Answer : a) True

Define Segmentation?

Description : Define Segmentation?

Last Answer :  The process of finding the words boundaries in a text with no spaces. 

What could possibly be the environment of a Satellite Image Analysis System? a) Computers in space and earth b) Image categorization techniques c) Statistical data on image pixel intensity value and histograms d) All of the mentioned

Description : What could possibly be the environment of a Satellite Image Analysis System? a) Computers in space and earth b) Image categorization techniques c) Statistical data on image pixel intensity value and histograms d) All of the mentioned

Last Answer : d) All of the mentioned

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level

In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)

Last Answer : (B) (~P∨Q)∧(~Q∨P)

In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q

Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q 

Last Answer : (B) Q 

What is Coreference Resolution? a) Anaphora Resolution b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”) c) All of the mentioned d) None of the mentioned

Description : What is Coreference Resolution? a) Anaphora Resolution b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”) c) All of the mentioned d) None of the mentioned

Last Answer : b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”)

What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label

Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Description : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks

Last Answer : d) Partitioned Networks

Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Last Answer : b) Fuzzy logic

The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Last Answer : c) Logic Theorist

Which combines inductive methods with the power of first-order representations? a) Inductive programming b) Logic programming c) Inductive logic programming d) Lisp programming

Description : Which combines inductive methods with the power of first-order representations? a) Inductive programming b) Logic programming c) Inductive logic programming d) Lisp programming

Last Answer : c) Inductive logic programming