Abstract
Languages of directed acyclic graphs (DAGs) are of interest in Natural Language Processing because they can be used to capture the structure of semantic graphs like those of Abstract Meaning Representation. This paper gives an overview of recent results on a family of automata recognizing such DAG languages.
Cite
CITATION STYLE
APA
Drewes, F. (2017). DAG automata for meaning representation. In MOL 2017 - 15th Meeting on the Mathematics of Language, Proceedings of the Conference (pp. 88–99). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/w17-3409
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free