AMR Flashcards

1
Q

How does amr represent each sentence?

A

as a rooted, directed, acyclic graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Are AMRs graphs or trees?

A

graphs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Concept identification

A

assigning graph fragments to words

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

relation identification

A

adding graph edges which connect these fragments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are as-graphs?

A

directed graphs with node and edge labels in which certain nodes have been designated as sources.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How many roots does an as-graph have?

A

always exactly one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does the APP operation do?

A

It adds an argument to a predicate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does the MOD operation do?

A

It adds a modifier to a graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What would MOD_a(GH, GM) do?

A

It combines head GH with modifier GM. It plugs the root of GH into the a-source node of GM.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What do AM types govern?

A

the combination of graphs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What do CCG categories control?

A

the combination of strings

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the head index of a subtree t?

A

the index of the token which contributed the root of the as-graph to which t evaluates.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does a well-typed AM-term always evaluate to?

A

An as-graph.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly