Papers by Ieva Vasiljeva
The problem with probabilistic DAG automata for semantic graphs (N19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) annotations are directed acyclic graphs, but most probabilistic models view them as strings or trees. |
| Approach: | They show that some DAG automata cannot be made into useful probabilistic models by assigning weights to transitions. |
| Outcome: | The proposed model can't be made into useful probabilistic models by assigning weights to transitions . the proposed model is not feasible for all variants, but it is problematic for planar variants if they are not rooted . |