A Compositional Typed Semantics for Universal Dependencies
Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we can take advantage of language-general connections between mea...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Bradford, Laurestine O'Donnell, Timothy John Reddy, Siva |
description | Languages may encode similar meanings using different sentence structures.
This makes it a challenge to provide a single set of formal rules that can
derive meanings from sentences in many languages at once. To overcome the
challenge, we can take advantage of language-general connections between
meaning and syntax, and build on cross-linguistically parallel syntactic
structures. We introduce UD Type Calculus, a compositional, principled, and
language-independent system of semantic types and logical forms for lexical
items which builds on a widely-used language-general dependency syntax
framework. We explain the essential features of UD Type Calculus, which all
involve giving dependency relations denotations just like those of words. These
allow UD-TC to derive correct meanings for sentences with a wide range of
syntactic structures by making use of dependency labels. Finally, we present
evaluation results on a large existing corpus of sentences and their logical
forms, showing that UD-TC can produce meanings comparable with our baseline. |
doi_str_mv | 10.48550/arxiv.2403.01187 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2403_01187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2403_01187</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-3d675081a914b5fb28188f1e1ddf8151e00ef2eb3882ad8438bc1898f44bbcb03</originalsourceid><addsrcrecordid>eNotj71qwzAURrV0CGkfIFP1AnZ1LSm-yRbc9AcMGerMRrKuQBDLRgohefu2aaczfHD4DmMrEKVCrcWLSddwKSslZCkAsF6w7Y430zhPOZzDFM2Jd7eZHP-i0cRzGDL3U-LHGC6U8s_6SjNFR3EIlB_ZgzenTE__XLLubd81H0V7eP9sdm1h1nVdSLeutUAwG1BWe1shIHogcM4jaCAhyFdkJWJlHCqJdgDcoFfK2sEKuWTPf9r7-X5OYTTp1v9G9PcI-Q0jnEGR</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Compositional Typed Semantics for Universal Dependencies</title><source>arXiv.org</source><creator>Bradford, Laurestine ; O'Donnell, Timothy John ; Reddy, Siva</creator><creatorcontrib>Bradford, Laurestine ; O'Donnell, Timothy John ; Reddy, Siva</creatorcontrib><description>Languages may encode similar meanings using different sentence structures.
This makes it a challenge to provide a single set of formal rules that can
derive meanings from sentences in many languages at once. To overcome the
challenge, we can take advantage of language-general connections between
meaning and syntax, and build on cross-linguistically parallel syntactic
structures. We introduce UD Type Calculus, a compositional, principled, and
language-independent system of semantic types and logical forms for lexical
items which builds on a widely-used language-general dependency syntax
framework. We explain the essential features of UD Type Calculus, which all
involve giving dependency relations denotations just like those of words. These
allow UD-TC to derive correct meanings for sentences with a wide range of
syntactic structures by making use of dependency labels. Finally, we present
evaluation results on a large existing corpus of sentences and their logical
forms, showing that UD-TC can produce meanings comparable with our baseline.</description><identifier>DOI: 10.48550/arxiv.2403.01187</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>2024-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2403.01187$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2403.01187$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bradford, Laurestine</creatorcontrib><creatorcontrib>O'Donnell, Timothy John</creatorcontrib><creatorcontrib>Reddy, Siva</creatorcontrib><title>A Compositional Typed Semantics for Universal Dependencies</title><description>Languages may encode similar meanings using different sentence structures.
This makes it a challenge to provide a single set of formal rules that can
derive meanings from sentences in many languages at once. To overcome the
challenge, we can take advantage of language-general connections between
meaning and syntax, and build on cross-linguistically parallel syntactic
structures. We introduce UD Type Calculus, a compositional, principled, and
language-independent system of semantic types and logical forms for lexical
items which builds on a widely-used language-general dependency syntax
framework. We explain the essential features of UD Type Calculus, which all
involve giving dependency relations denotations just like those of words. These
allow UD-TC to derive correct meanings for sentences with a wide range of
syntactic structures by making use of dependency labels. Finally, we present
evaluation results on a large existing corpus of sentences and their logical
forms, showing that UD-TC can produce meanings comparable with our baseline.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71qwzAURrV0CGkfIFP1AnZ1LSm-yRbc9AcMGerMRrKuQBDLRgohefu2aaczfHD4DmMrEKVCrcWLSddwKSslZCkAsF6w7Y430zhPOZzDFM2Jd7eZHP-i0cRzGDL3U-LHGC6U8s_6SjNFR3EIlB_ZgzenTE__XLLubd81H0V7eP9sdm1h1nVdSLeutUAwG1BWe1shIHogcM4jaCAhyFdkJWJlHCqJdgDcoFfK2sEKuWTPf9r7-X5OYTTp1v9G9PcI-Q0jnEGR</recordid><startdate>20240302</startdate><enddate>20240302</enddate><creator>Bradford, Laurestine</creator><creator>O'Donnell, Timothy John</creator><creator>Reddy, Siva</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240302</creationdate><title>A Compositional Typed Semantics for Universal Dependencies</title><author>Bradford, Laurestine ; O'Donnell, Timothy John ; Reddy, Siva</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-3d675081a914b5fb28188f1e1ddf8151e00ef2eb3882ad8438bc1898f44bbcb03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Bradford, Laurestine</creatorcontrib><creatorcontrib>O'Donnell, Timothy John</creatorcontrib><creatorcontrib>Reddy, Siva</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bradford, Laurestine</au><au>O'Donnell, Timothy John</au><au>Reddy, Siva</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Compositional Typed Semantics for Universal Dependencies</atitle><date>2024-03-02</date><risdate>2024</risdate><abstract>Languages may encode similar meanings using different sentence structures.
This makes it a challenge to provide a single set of formal rules that can
derive meanings from sentences in many languages at once. To overcome the
challenge, we can take advantage of language-general connections between
meaning and syntax, and build on cross-linguistically parallel syntactic
structures. We introduce UD Type Calculus, a compositional, principled, and
language-independent system of semantic types and logical forms for lexical
items which builds on a widely-used language-general dependency syntax
framework. We explain the essential features of UD Type Calculus, which all
involve giving dependency relations denotations just like those of words. These
allow UD-TC to derive correct meanings for sentences with a wide range of
syntactic structures by making use of dependency labels. Finally, we present
evaluation results on a large existing corpus of sentences and their logical
forms, showing that UD-TC can produce meanings comparable with our baseline.</abstract><doi>10.48550/arxiv.2403.01187</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2403.01187 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2403_01187 |
source | arXiv.org |
subjects | Computer Science - Computation and Language |
title | A Compositional Typed Semantics for Universal Dependencies |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T04%3A00%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Compositional%20Typed%20Semantics%20for%20Universal%20Dependencies&rft.au=Bradford,%20Laurestine&rft.date=2024-03-02&rft_id=info:doi/10.48550/arxiv.2403.01187&rft_dat=%3Carxiv_GOX%3E2403_01187%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |