{"title":"DAG Automata for Meaning Representation","authors":"F. Drewes","doi":"10.18653/v1/W17-3409","DOIUrl":null,"url":null,"abstract":"Languages of directed acyclic graphs (DAGs) are of interest in Natural Lanuage Processing because they can be used to capture the structure of semantic graphs like those of Abstract Meaning Represe ...","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"36 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Language","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W17-3409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Languages of directed acyclic graphs (DAGs) are of interest in Natural Lanuage Processing because they can be used to capture the structure of semantic graphs like those of Abstract Meaning Represe ...