"""Utilities for ConLL-U dependency output format."""
from .constants import LEMMAS, TAGS, HEADS, DEPRELS, GRAPH_HEADS, GRAPH_DEPRELS
from .types import TokenList, LabelDict
[docs]
def get_conllu(tokens: TokenList, labels: LabelDict, nps: list[bool] | None) -> str:
"""Generate a ConLL-U formatted dependency tree representation.
Returns:
the ConLL-U string.
"""
if not tokens:
return ''
conllu = []
if not nps:
nps = [False for x in tokens]
space_after = ['SpaceAfter=False' if x else '_' for x in nps[1:]] + ['_']
for i, (token, lemma, tag, head, deprel, graph_heads, graph_deprels, sa) in enumerate(
zip(
tokens,
labels.get(LEMMAS, ['_' for x in tokens]),
labels.get(TAGS, ['_' for x in tokens]),
labels[HEADS],
labels[DEPRELS],
labels.get(GRAPH_HEADS, [[] for x in tokens]),
labels.get(GRAPH_DEPRELS, [[] for x in tokens]),
space_after),
start=1):
head = head + 1 if head is not None else 0
pos = tag.split(':')[0]
deps = '|'.join(f'{h}:{d}' for h, d in zip([head] + [h + 1 if h is not None else 0 for h in graph_heads], [deprel] + graph_deprels))
conllu.append('\t'.join([str(i), token, lemma, pos, tag, '_', str(head), deprel, deps, sa]))
return '\n'.join(conllu)