Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 72
Página 400
Unfortunately , to solve the lexical disambiguation problem completely , it
becomes necessary to introduce more and more finely grained semantic markers
. For example , to interpret the sentence about Susan ' s diamond correctly , we
must ...
Unfortunately , to solve the lexical disambiguation problem completely , it
becomes necessary to introduce more and more finely grained semantic markers
. For example , to interpret the sentence about Susan ' s diamond correctly , we
must ...
Página 403
The principal advantages of semantic grammars are the following : When the
parse is complete , the result can be used immediately without the additional
stage of processing that would be required if a semantic interpretation had not
already ...
The principal advantages of semantic grammars are the following : When the
parse is complete , the result can be used immediately without the additional
stage of processing that would be required if a semantic interpretation had not
already ...
Página 410
Montague Semantics Recall that we argued in Section 15 . 1 . 1 that the reason
syntactic parsing was a good idea was that it produces structures that correspond
to the structures that should result from semantic processing . If we investigate ...
Montague Semantics Recall that we argued in Section 15 . 1 . 1 that the reason
syntactic parsing was a good idea was that it produces structures that correspond
to the structures that should result from semantic processing . If we investigate ...
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