Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar

Semantic grammars are _____________

a) Encode semantic information into a syntactic grammar

b) Decode semantic information into a syntactic grammar

c) Encode syntactic information into a semantic grammar

d) Decode syntactic information into a semantic grammar
by

1 Answer

Answer :

a) Encode semantic information into a syntactic grammar
by

Related questions

What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Description : What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned

Last Answer : c) Pragmatic

Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned

Description : Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned

Last Answer : a) Syntactic distinction

What is the extraction of the meaning of utterance? a) Syntactic b) Semantic c) Pragmatic d) None of the mentioned

Description : What is the extraction of the meaning of utterance? a) Syntactic b) Semantic c) Pragmatic d) None of the mentioned

Last Answer : b) Semantic

Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Description : Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Last Answer : A. Regular Grammar

Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Last Answer : b) Directed graph

Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct.

Rules of content, interpretation and meaning are called semantic rules. A high - level programming language is determined by its _____rules: a) Semantic Rules b) Syntactic Rules c) Both of Above d) None of These

Description : Rules of content, interpretation and meaning are called semantic rules. A high - level programming language is determined by its _____rules: a) Semantic Rules b) Syntactic Rules c) Both of Above d) None of These

Last Answer : c) Both of Above

What is the difference between semantic and syntactic match types? A. Semantic match type focuses on the actual words; and syntactic match type focuses on the meaning of the words. B. Syntactic match type focuses on the actual words; and semantic focuses on the meaning of the words. C. Syntactic match type is an old match type that you can no longer create. D. Each match type can show up for words in any order as long as all your keywords are in the search term

Description : What is the difference between semantic and syntactic match types? A. Semantic match type focuses on the actual words; and syntactic match type focuses on the meaning of the words. B. Syntactic match type ... can show up for words in any order as long as all your keywords are in the search term

Last Answer : B. Syntactic match type focuses on the actual words; and semantic focuses on the meaning of the words.

High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic

Description : High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic

Last Answer : (D) Pragmatic

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

What is meant by quasi-logical form? a) Sits between syntactic and logical form b) Logical connectives c) All of the mentioned d) None of the mentioned

Description : What is meant by quasi-logical form? a) Sits between syntactic and logical form b) Logical connectives c) All of the mentioned d) None of the mentioned

Last Answer : a) Sits between syntactic and logical form

A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Description : A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Last Answer : a) Deductive Systems

In language understanding, the levels of knowledge that does not include? a) Phonological b) Syntactic c) Empirical d) Logical

Description : In language understanding, the levels of knowledge that does not include? a) Phonological b) Syntactic c) Empirical d) Logical

Last Answer : c) Empirical

Ambiguity may be caused by ______________ a) syntactic ambiguity b) multiple word meanings c) unclear antecedents d) all of the mentioned

Description : Ambiguity may be caused by ______________ a) syntactic ambiguity b) multiple word meanings c) unclear antecedents d) all of the mentioned

Last Answer : d) all of the mentioned

Define syntactic sugar.

Description : Define syntactic sugar. 

Last Answer : Extension to the standard syntax (i.e.) procedure that does not change the semantics (i.e.) meaning is called syntactic sugar. 

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

The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Description : The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Last Answer : a) binary

What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Last Answer : c) Both Logical term & Complete logical sentence

What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Description : What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation

Last Answer : c) Semantic interpretation

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Like semantic networks, frames can be queried using spreading activation. a) True b) False

Description : Like semantic networks, frames can be queried using spreading activation. a) True b) False

Last Answer : a) True

Frames in artificial intelligence is derived from semantic nets. a) True b) False

Description : Frames in artificial intelligence is derived from semantic nets. a) True b) False

Last Answer : a) True

Most semantic networks are not cognitive based. a) True b) False

Description : Most semantic networks are not cognitive based. a) True b) False

Last Answer : b) False

Semantic Network is also known as Frame networks. a) True b) False

Description : Semantic Network is also known as Frame networks. a) True b) False

Last Answer : a) True

What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Description : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints

Last Answer : b) Lack in expressing some of the properties

A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Description : A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Last Answer : a) True

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

The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Which of the following are the Semantic Relations used in Semantic Networks? a) Meronymy b) Holonymy c) Hyponymy d) All of the mentioned

Description : Which of the following are the Semantic Relations used in Semantic Networks? a) Meronymy b) Holonymy c) Hyponymy d) All of the mentioned

Last Answer : d) All of the mentioned

What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Description : What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Last Answer : a) A way of representing knowledge

Define Semantic Interpretation.

Description : Define Semantic Interpretation.

Last Answer :  The process of extracting the meaning of an utterance an expression in some representation language. 

Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Last Answer : c) Execution monitoring

An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions

Description : An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions

Last Answer : b) contains procedural knowledge

What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase

Description : What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase

Last Answer : c) Grammar

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free

Last Answer : d) The intersection two context-free languages is context-free

What is used to augment a grammar for arithmetic expression with semantics? a) Notation b) DCG notation c) Constituent d) All of the mentioned

Description : What is used to augment a grammar for arithmetic expression with semantics? a) Notation b) DCG notation c) Constituent d) All of the mentioned

Last Answer : b) DCG notation

Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the complement need not be c) Every regular language is context-free because it can be described by a regular grammar d) The intersection of a context-free language and a regular language is always context-free e) The intersection two context-free languages is context-free

Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free

Last Answer : e) The intersection two context-free languages is context-free

How do you log into literacy planet with grammars monster birthday?

Description : How do you log into literacy planet with grammars monster birthday?

Last Answer : Feel Free to Answer

People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Description : People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Last Answer : d) both understanding ideas in context & identifying with familiar situations

It is used to encode the minimum amount of speech information necessary to reproduce a perceptible message with a fewer bits that those needed by a conventional encoder/decoder

Description : It is used to encode the minimum amount of speech information necessary to reproduce a perceptible message with a fewer bits that those needed by a conventional encoder/decoder

Last Answer : vocoders

What guides and grammars have been asked to buy this year in the eighth grade at Restabudium High School in Konabari, Gazipur ? Say the full name of the educational institution and also tell what happens in the educational institution and how it happens

Description : What guides and grammars have been asked to buy this year in the eighth grade at Restabudium High School in Konabari, Gazipur ? Say the full name of the educational institution and also tell what happens in the educational institution and how it happens

Last Answer : It is not possible to say because it can only be said by the students, teachers and people of the school.

Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. Which of the following is true? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Description : Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. ... and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Last Answer : (A) S1 is correct and S2 is not correct.

Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 4

The hardware feature of LISP machines generally includes _____________ a) Large memory and high-speed processorb) Letter quality printers and eight-inch disk drives c) A mouse and specialized keyboard d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Description : The hardware feature of LISP machines generally includes _____________ a) Large memory and high-speed processorb) Letter quality printers and eight-inch disk drives c) A mouse and specialized keyboard d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Last Answer : d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

In LISP, the square root of X is referenced as _____________ a) sqrt(x) b) (sqrt x) c) x/2 d) x/3

Description : In LISP, the square root of X is referenced as _____________ a) sqrt(x) b) (sqrt x) c) x/2 d) x/3

Last Answer : b) (sqrt x)

In linguistic morphology _____________ is the process for reducing inflected words to their root form. a) Rooting b) Stemming c) Text-Proofing d) Both Rooting & Stemming

Description : In linguistic morphology _____________ is the process for reducing inflected words to their root form. a) Rooting b) Stemming c) Text-Proofing d) Both Rooting & Stemming

Last Answer : b) Stemming

_____________ 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

Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Description : Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Last Answer : c) Data-driven, goal-driven

Treatment chosen by doctor for a patient for a disease is based on _____________ a) Only current symptoms b) Current symptoms plus some knowledge from the textbooks c) Current symptoms plus some knowledge from the textbooks plus experience d) All of the mentioned

Description : Treatment chosen by doctor for a patient for a disease is based on _____________ a) Only current symptoms b) Current symptoms plus some knowledge from the textbooks c) Current symptoms plus some knowledge from the textbooks plus experience d) All of the mentioned

Last Answer : c) Current symptoms plus some knowledge from the textbooks plus experience