You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
alexanderkoller edited this page Jul 17, 2019
·
5 revisions
The AM parser internally represents derivations of graphs as AM dependency trees. These can be written in a file in the AM-CoNLL file format, which is a variant of the usual CoNLL(-U) format for syntactic dependency trees.
The columns have the following meanings:
Column
Meaning
Corresponding CoNLL-U column
1
ID (position in sentence)
1 ID
2
FORM (exact word form)
2 FORM
3
REPLACEMENT (_name_, UNK, etc.); _ if no replacement needed
--
4
LEMMA
3 LEMMA
5
POS
4 UPOS
6
NER: named entity tag, or O if none
--
7
delexicalized supertag
--
8
lexical label (for relexicalizing the supertag)
--
9
type (not included in delexicalized supertag)
--
10
HEAD (head ID, 0 if no head)
7 HEAD
11
DEPREL (incoming edge label)
8 DEPREL
12
aligned (true or false)
--
Every line that starts with # is a comment and can be ignored. For some purposes sentences can have additional attributes (like raw untokenized sentence) then we add a line with the format #[key]:[value]. For instance:
#raw:New York is great!
Unparsed AM-CoNLL files (which serve as input to the AM parser) only have meaningful values in columns 1-6, and blank values in the other columns. The AM parser will then output another AM-CoNLL file with the other columns filled in.