Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 81
Página 386
Grammar formalisms such as this one underlie many linguistic theories , which in
turn provide the basis for many natural language understanding systems .
Modern linguistic theories include : the government binding theory of Chomsky (
1981 ...
Grammar formalisms such as this one underlie many linguistic theories , which in
turn provide the basis for many natural language understanding systems .
Modern linguistic theories include : the government binding theory of Chomsky (
1981 ...
Página 583
Data Structures and Algorithms . Reading , MA : Addison - Wesley . Allen , J .
1987 . Natural Language Understanding . Menlo Park , CA : Benjamin /
Cummings . Allen , J . 1989 . Natural language understanding . In The Handbook
of Artificial ...
Data Structures and Algorithms . Reading , MA : Addison - Wesley . Allen , J .
1987 . Natural Language Understanding . Menlo Park , CA : Benjamin /
Cummings . Allen , J . 1989 . Natural language understanding . In The Handbook
of Artificial ...
Página 602
ELIZA — a computer program for the study of natural language commurication
between man and machine . Communications of the ACM 9 ( 1 ) : 36 – 44 . Weld ,
D . S . and J . de Kleer , eds . 1988 . Readings in Qualitative Reasoning about ...
ELIZA — a computer program for the study of natural language commurication
between man and machine . Communications of the ACM 9 ( 1 ) : 36 – 44 . Weld ,
D . S . and J . de Kleer , eds . 1988 . Readings in Qualitative Reasoning about ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter choose clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights