- expands most promising paths first
- avoids expanding paths that are, from the beginning, already expensive
- at each step it picks the node using the sum of two other parameters:
g = the movement cost to move from the starting point to a given square
h = the estimated movement cost to move from that given square on the grid to the final destination.
- hidden computer A and a person B converse with another person C
- If C is unable to distinguish which he is conversing with, then the computer can be said to be able to "think"
a. the system is not responding and the user cannot use the system as supposed to. The user then must restart the computer, but the system must first save the users work.
b. the user must perform a response to the system, before it is possible for the user to continue with the current task/function in the system.
c. the users have different experience and background, but must learn how to use the same system in a short time period.
An interview has many differences from a conversation. An interview has which of the following set of qualities:
a) Informally arranged; audio recorded; no specific goal; last about 30 minutes.
b) Is planned and organised; a premium placed on making everyone feel comfortable; the interviewee is responsible for the topics covered in the interview
c) A definite purpose; planned and organised; a premium placed on making meanings explicit; the interviewer is responsible for the topics.
When interviewing people about their technology usage, there is often a slight mismatch with e.g. recorded or logged data of their interactions. Why is that?
a) The data is wrong, because the person is always right.
b) People are not always fully aware of what they do.
c) People are lying because they are dishonest and may want to ruin the study
Name and explain 2 different representation forms of NLP.
Frames
- cluster of facts and objects about some typical object, situation, or action, along with specific strategies of inference for reasoning about such a situation,
Ontologies
– extract corresponding domain's terms and relationships between those concepts
-Defines a common vocabulary/ common understanding
Explain what a finite state machine is and what it got to do with Natural Language Processing.
- It is an abstract machine that can be in exactly one of a finite number of states at any given time
- can change from one state to another in response to some external inputs and/or a condition is satisfied; the change from one state to another is called a transition
An algorithm used in game playing where one opponent tries to maximise their chance of winning and minimise their opponent's chance at every move
Talk through how the MiniMax algorithm works (different for different problems of course)
Set of values at terminal positions (triangles) at the bottom.
Level above is the last player who played a move
If + value is PC winning and they played the last move, we move every positive value up to their parents
If - value is ME winning, on the level above that, move the smaller values up to their parents
Keep going until you reach the root
A Heuristic search which combines the cost so far and the estimated cost to goal.
f(n) = g(n) + h(n) where g is path cost from initial state to current, h is heuristic cost from current state to goal and f is the overall estimated cost.