# Abstract Meaning Representation

Abstract Meaning Representation (AMR)[1][2] is a semantic representation language. AMR graphs are rooted, labeled, directed, acyclic graphs (DAGs), comprising whole sentences. They are intended to abstract away from syntactic representations, in the sense that sentences which are similar in meaning should be assigned the same AMR, even if they are not identically worded. By nature, the AMR language is biased towards English – it is not meant to function as an international auxiliary language.

## Example

In this paper,[1] there are these two equivalent formats for representing the same sentence: The boy wants to go.

### Logic format

${\displaystyle \exists w,b,g:instance(w,want\_01)\wedge instance(g,go\_01)\wedge instance(b,boy)\wedge arg0(w,b)\wedge arg1(w,g)\wedge arg0(g,b)}$

### AMR format

```(w / want-01
:arg0 (b / boy)
:arg1 (g / go-01
:arg0 b))```

This last representation makes the will of the boy more explicit, highlighting that the intention of the boy is that he himself goes away.

## References

1. ^ a b Banarescu, Laura; Bonial, Claire; Cai, Shu; Georgescu, Madalina; Griffitt, Kira; Hermjakob, Ulf; Knight, Kevin; Koehn, Philipp; Palmer, Martha; Schneider, Nathan (2013). Abstract Meaning Representation for Sembanking (PDF). Sofia, Bulgaria: Association for Computational Linguistics. pp. 178–186. Retrieved 28 June 2019.
2. ^