• No results found

DepDist: Surface realization via regex and learned dependency distance tolerance

N/A
N/A
Protected

Academic year: 2020

Share "DepDist: Surface realization via regex and learned dependency distance tolerance"

Copied!
10
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Figure 1: Target dependency distance tolerances forthat big house theredependency relations and, represented as (a) a DAG showing (b) the topological sort.
Figure 2: Linearizing a DAG. (a) A networkx graphprovides the input and output of the GNN
Figure 4: BLEU scores from dev sets realized as pro-jective wordforms (red), projective lemmas (green),and non-projective lemmas (blue).
Table 2: The number of lemmas in each test corpusshowing (1) the number and percentage for which mor-phological features were given and (2) the number andpercentage of wordforms generated via regex.

References

Related documents

Given a model of uncertainty in the fluctuation of radio power, and the implied inference concerning current and future signal power that results from a fast and highly

In this study, we found that autotomy of a single hindlimb significantly reduced endurance and also increased the metabolic costs of locomotion for these animals. Both

These findings again reinforce the idea that smaller animals require substantial power amplification of muscle power output via energy storage in elastic structures to allow them

The examination was most sensitive for detecting lesions in the cerebral hemispheres, the posterior fossa, and the cervical spinal cord, in that order; it did not detect

De meeste gebruikte methode om een waardering te geven is de discounted cashflow methode (DCF methode). Omdat er bij deze rekenmethode subjectieve inputvariabelen zijn, die de

The object of this note is to introduce and study topological properties of α - derived, α -border, α -frontier, and α -exterior of a set using the concept of α -open sets..

The method of induction will be used to de- termine the existence of a non-zero lower bound for the number of Goldbach partitions of an even integer.. Suppose that the even integer n

The vertex edge arboricity of G denoted by a G a 1 G is the minimum number of subsets into which the vertex edge set of G can be partitioned so that each subset induces