Bidirectional Contextual Resolution
This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an under specified meaning representation, related to resolved lo...
Gespeichert in:
| Veröffentlicht in: | Computational linguistics - Association for Computational Linguistics 2000-12, Vol.26 (4), p.497-537 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 537 |
|---|---|
| container_issue | 4 |
| container_start_page | 497 |
| container_title | Computational linguistics - Association for Computational Linguistics |
| container_volume | 26 |
| creator | Pulman, Stephen G. |
| description | This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an under specified meaning representation, related to resolved logical forms via conditional equivalences. These equivalences define the interpretation of contextually dependent constructs with respect to a given context. Higher-order unification and abduction are used in relating expressions to contexts. The conditional equivalences can be used unchanged in both the interpretation and the generation direction. |
| doi_str_mv | 10.1162/089120100750105939 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_mit_j</sourceid><recordid>TN_cdi_mit_journals_10_1162_089120100750105939</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_47b841de14de47419d60b840eb5cb97f</doaj_id><sourcerecordid>85537659</sourcerecordid><originalsourceid>FETCH-LOGICAL-c486t-c660dda037584f31164cb25c9f8f74582de3f69e4cf8e65fa4da9e87e1ad296c3</originalsourceid><addsrcrecordid>eNqFkctKAzEUhoMoWC8v4EoQ3U1NJvelFi-FgiC6DmlyIinTpiYzoG9vakUXgm6S8POdj0N-hE4IHhMi2kusNGkxwVjyenJN9Q4aEU5xoylpd9FoAzSVkPvooJQFriSmcoTOrqOPGVwf08p2p5O06uGtH-rzEUrqhk1-hPaC7Qocf92H6Pn25mly38we7qaTq1njmBJ944TA3tuq5YoFWvdibt5yp4MKknHVeqBBaGAuKBA8WOatBiWBWN9q4eghmm69PtmFWee4tPndJBvNZ5Dyi7G5j64Dw-RcMeKBMA9MMqK9wDXBMOdurmWorouta53T6wClN8tYHHSdXUEailGcUynqR_0HtppSJgmtYLsFXU6lZAjfGxJsNiWY3yXUofMvuy3OdiHblYvlZ5JVXmNSufGWW8beLNKQaxnlL_EHjr2Rrw</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29334713</pqid></control><display><type>article</type><title>Bidirectional Contextual Resolution</title><source>Alma/SFX Local Collection</source><creator>Pulman, Stephen G.</creator><creatorcontrib>Pulman, Stephen G.</creatorcontrib><description>This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an under specified meaning representation, related to resolved logical forms via conditional equivalences. These equivalences define the interpretation of contextually dependent constructs with respect to a given context. Higher-order unification and abduction are used in relating expressions to contexts. The conditional equivalences can be used unchanged in both the interpretation and the generation direction.</description><identifier>ISSN: 0891-2017</identifier><identifier>EISSN: 1530-9312</identifier><identifier>DOI: 10.1162/089120100750105939</identifier><identifier>CODEN: AJCLD9</identifier><language>eng</language><publisher>One Rogers Street, Cambridge, MA 02142-1209, USA: MIT Press</publisher><subject>Applied linguistics ; Computational linguistics ; Linguistics</subject><ispartof>Computational linguistics - Association for Computational Linguistics, 2000-12, Vol.26 (4), p.497-537</ispartof><rights>2002 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c486t-c660dda037584f31164cb25c9f8f74582de3f69e4cf8e65fa4da9e87e1ad296c3</citedby><cites>FETCH-LOGICAL-c486t-c660dda037584f31164cb25c9f8f74582de3f69e4cf8e65fa4da9e87e1ad296c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27928,27929</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14201901$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Pulman, Stephen G.</creatorcontrib><title>Bidirectional Contextual Resolution</title><title>Computational linguistics - Association for Computational Linguistics</title><description>This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an under specified meaning representation, related to resolved logical forms via conditional equivalences. These equivalences define the interpretation of contextually dependent constructs with respect to a given context. Higher-order unification and abduction are used in relating expressions to contexts. The conditional equivalences can be used unchanged in both the interpretation and the generation direction.</description><subject>Applied linguistics</subject><subject>Computational linguistics</subject><subject>Linguistics</subject><issn>0891-2017</issn><issn>1530-9312</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNqFkctKAzEUhoMoWC8v4EoQ3U1NJvelFi-FgiC6DmlyIinTpiYzoG9vakUXgm6S8POdj0N-hE4IHhMi2kusNGkxwVjyenJN9Q4aEU5xoylpd9FoAzSVkPvooJQFriSmcoTOrqOPGVwf08p2p5O06uGtH-rzEUrqhk1-hPaC7Qocf92H6Pn25mly38we7qaTq1njmBJ944TA3tuq5YoFWvdibt5yp4MKknHVeqBBaGAuKBA8WOatBiWBWN9q4eghmm69PtmFWee4tPndJBvNZ5Dyi7G5j64Dw-RcMeKBMA9MMqK9wDXBMOdurmWorouta53T6wClN8tYHHSdXUEailGcUynqR_0HtppSJgmtYLsFXU6lZAjfGxJsNiWY3yXUofMvuy3OdiHblYvlZ5JVXmNSufGWW8beLNKQaxnlL_EHjr2Rrw</recordid><startdate>20001201</startdate><enddate>20001201</enddate><creator>Pulman, Stephen G.</creator><general>MIT Press</general><general>The MIT Press</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7T9</scope><scope>DOA</scope></search><sort><creationdate>20001201</creationdate><title>Bidirectional Contextual Resolution</title><author>Pulman, Stephen G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c486t-c660dda037584f31164cb25c9f8f74582de3f69e4cf8e65fa4da9e87e1ad296c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Applied linguistics</topic><topic>Computational linguistics</topic><topic>Linguistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pulman, Stephen G.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Linguistics and Language Behavior Abstracts (LLBA)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Computational linguistics - Association for Computational Linguistics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pulman, Stephen G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bidirectional Contextual Resolution</atitle><jtitle>Computational linguistics - Association for Computational Linguistics</jtitle><date>2000-12-01</date><risdate>2000</risdate><volume>26</volume><issue>4</issue><spage>497</spage><epage>537</epage><pages>497-537</pages><issn>0891-2017</issn><eissn>1530-9312</eissn><coden>AJCLD9</coden><abstract>This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an under specified meaning representation, related to resolved logical forms via conditional equivalences. These equivalences define the interpretation of contextually dependent constructs with respect to a given context. Higher-order unification and abduction are used in relating expressions to contexts. The conditional equivalences can be used unchanged in both the interpretation and the generation direction.</abstract><cop>One Rogers Street, Cambridge, MA 02142-1209, USA</cop><pub>MIT Press</pub><doi>10.1162/089120100750105939</doi><tpages>41</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0891-2017 |
| ispartof | Computational linguistics - Association for Computational Linguistics, 2000-12, Vol.26 (4), p.497-537 |
| issn | 0891-2017 1530-9312 |
| language | eng |
| recordid | cdi_mit_journals_10_1162_089120100750105939 |
| source | Alma/SFX Local Collection |
| subjects | Applied linguistics Computational linguistics Linguistics |
| title | Bidirectional Contextual Resolution |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T02%3A39%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_mit_j&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Bidirectional%20Contextual%20Resolution&rft.jtitle=Computational%20linguistics%20-%20Association%20for%20Computational%20Linguistics&rft.au=Pulman,%20Stephen%20G.&rft.date=2000-12-01&rft.volume=26&rft.issue=4&rft.spage=497&rft.epage=537&rft.pages=497-537&rft.issn=0891-2017&rft.eissn=1530-9312&rft.coden=AJCLD9&rft_id=info:doi/10.1162/089120100750105939&rft_dat=%3Cproquest_mit_j%3E85537659%3C/proquest_mit_j%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29334713&rft_id=info:pmid/&rft_doaj_id=oai_doaj_org_article_47b841de14de47419d60b840eb5cb97f&rfr_iscdi=true |