Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models
Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a recent paradigm that attempts to induce constituency parse trees relying only on the internal knowledge of pre-trained language models. While attractive in the perspective that similar to in-context learning, it does not r...
Gespeichert in:
1. Verfasser: | |
---|---|
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 | Kim, Taeuk |
description | Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a
recent paradigm that attempts to induce constituency parse trees relying only
on the internal knowledge of pre-trained language models. While attractive in
the perspective that similar to in-context learning, it does not require
task-specific fine-tuning, the practical effectiveness of such an approach
still remains unclear, except that it can function as a probe for investigating
language models' inner workings. In this work, we mathematically reformulate
CPE-PLM and propose two advanced ensemble methods tailored for it,
demonstrating that the new parsing paradigm can be competitive with common
unsupervised parsers by introducing a set of heterogeneous PLMs combined using
our techniques. Furthermore, we explore some scenarios where the trees
generated by CPE-PLM are practically useful. Specifically, we show that CPE-PLM
is more effective than typical supervised parsers in few-shot settings. |
doi_str_mv | 10.48550/arxiv.2211.00479 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2211_00479</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2211_00479</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-aeb8775a08595fc034f5e013162e81dbdc1beb14a5a29a6c8e3286dabff9bb923</originalsourceid><addsrcrecordid>eNotj89OhDAYxLl4MKsP4Mm-ANgChfZoCP5JMG7M3snX8pVtwhbTdsnu24voaSaTmUl-SfLAaFYKzukT-ItdsjxnLKO0rOVtcvzCxQYbrRtJPCLZe9DRaphIawyudkGHIZDZkGZ2Idp4RqevZA8-IGkvcevPjhg_n9Y1pmtiHQ6kAzeeYUTyMQ84hbvkxsAU8P5fd8nhpT00b2n3-frePHcpVLVMAZWoaw5UcMmNpkVpOFJWsCpHwQY1aKZQsRI45BIqLbDIRTWAMkYqJfNilzz-3W6o_be3J_DX_he535CLH3g4U7U</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models</title><source>arXiv.org</source><creator>Kim, Taeuk</creator><creatorcontrib>Kim, Taeuk</creatorcontrib><description>Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a
recent paradigm that attempts to induce constituency parse trees relying only
on the internal knowledge of pre-trained language models. While attractive in
the perspective that similar to in-context learning, it does not require
task-specific fine-tuning, the practical effectiveness of such an approach
still remains unclear, except that it can function as a probe for investigating
language models' inner workings. In this work, we mathematically reformulate
CPE-PLM and propose two advanced ensemble methods tailored for it,
demonstrating that the new parsing paradigm can be competitive with common
unsupervised parsers by introducing a set of heterogeneous PLMs combined using
our techniques. Furthermore, we explore some scenarios where the trees
generated by CPE-PLM are practically useful. Specifically, we show that CPE-PLM
is more effective than typical supervised parsers in few-shot settings.</description><identifier>DOI: 10.48550/arxiv.2211.00479</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>2022-09</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/2211.00479$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2211.00479$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Kim, Taeuk</creatorcontrib><title>Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models</title><description>Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a
recent paradigm that attempts to induce constituency parse trees relying only
on the internal knowledge of pre-trained language models. While attractive in
the perspective that similar to in-context learning, it does not require
task-specific fine-tuning, the practical effectiveness of such an approach
still remains unclear, except that it can function as a probe for investigating
language models' inner workings. In this work, we mathematically reformulate
CPE-PLM and propose two advanced ensemble methods tailored for it,
demonstrating that the new parsing paradigm can be competitive with common
unsupervised parsers by introducing a set of heterogeneous PLMs combined using
our techniques. Furthermore, we explore some scenarios where the trees
generated by CPE-PLM are practically useful. Specifically, we show that CPE-PLM
is more effective than typical supervised parsers in few-shot settings.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj89OhDAYxLl4MKsP4Mm-ANgChfZoCP5JMG7M3snX8pVtwhbTdsnu24voaSaTmUl-SfLAaFYKzukT-ItdsjxnLKO0rOVtcvzCxQYbrRtJPCLZe9DRaphIawyudkGHIZDZkGZ2Idp4RqevZA8-IGkvcevPjhg_n9Y1pmtiHQ6kAzeeYUTyMQ84hbvkxsAU8P5fd8nhpT00b2n3-frePHcpVLVMAZWoaw5UcMmNpkVpOFJWsCpHwQY1aKZQsRI45BIqLbDIRTWAMkYqJfNilzz-3W6o_be3J_DX_he535CLH3g4U7U</recordid><startdate>20220915</startdate><enddate>20220915</enddate><creator>Kim, Taeuk</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220915</creationdate><title>Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models</title><author>Kim, Taeuk</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-aeb8775a08595fc034f5e013162e81dbdc1beb14a5a29a6c8e3286dabff9bb923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Kim, Taeuk</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kim, Taeuk</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models</atitle><date>2022-09-15</date><risdate>2022</risdate><abstract>Constituency Parse Extraction from Pre-trained Language Models (CPE-PLM) is a
recent paradigm that attempts to induce constituency parse trees relying only
on the internal knowledge of pre-trained language models. While attractive in
the perspective that similar to in-context learning, it does not require
task-specific fine-tuning, the practical effectiveness of such an approach
still remains unclear, except that it can function as a probe for investigating
language models' inner workings. In this work, we mathematically reformulate
CPE-PLM and propose two advanced ensemble methods tailored for it,
demonstrating that the new parsing paradigm can be competitive with common
unsupervised parsers by introducing a set of heterogeneous PLMs combined using
our techniques. Furthermore, we explore some scenarios where the trees
generated by CPE-PLM are practically useful. Specifically, we show that CPE-PLM
is more effective than typical supervised parsers in few-shot settings.</abstract><doi>10.48550/arxiv.2211.00479</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2211.00479 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2211_00479 |
source | arXiv.org |
subjects | Computer Science - Computation and Language |
title | Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Models |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T14%3A32%3A14IST&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=Revisiting%20the%20Practical%20Effectiveness%20of%20Constituency%20Parse%20Extraction%20from%20Pre-trained%20Language%20Models&rft.au=Kim,%20Taeuk&rft.date=2022-09-15&rft_id=info:doi/10.48550/arxiv.2211.00479&rft_dat=%3Carxiv_GOX%3E2211_00479%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 |