@inproceedings{fujinuma-hagiwara-2021-semi,
title = "Semi-Supervised Joint Estimation of Word and Document Readability",
author = "Fujinuma, Yoshinari and
Hagiwara, Masato",
editor = "Panchenko, Alexander and
Malliaros, Fragkiskos D. and
Logacheva, Varvara and
Jana, Abhik and
Ustalov, Dmitry and
Jansen, Peter",
booktitle = "Proceedings of the Fifteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-15)",
month = jun,
year = "2021",
address = "Mexico City, Mexico",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2021.textgraphs-1.16",
doi = "10.18653/v1/2021.textgraphs-1.16",
pages = "150--155",
abstract = "Readability or difficulty estimation of words and documents has been investigated independently in the literature, often assuming the existence of extensive annotated resources for the other. Motivated by our analysis showing that there is a recursive relationship between word and document difficulty, we propose to jointly estimate word and document difficulty through a graph convolutional network (GCN) in a semi-supervised fashion. Our experimental results reveal that the GCN-based method can achieve higher accuracy than strong baselines, and stays robust even with a smaller amount of labeled data.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="fujinuma-hagiwara-2021-semi">
<titleInfo>
<title>Semi-Supervised Joint Estimation of Word and Document Readability</title>
</titleInfo>
<name type="personal">
<namePart type="given">Yoshinari</namePart>
<namePart type="family">Fujinuma</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Masato</namePart>
<namePart type="family">Hagiwara</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2021-06</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Fifteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-15)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Alexander</namePart>
<namePart type="family">Panchenko</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Fragkiskos</namePart>
<namePart type="given">D</namePart>
<namePart type="family">Malliaros</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Varvara</namePart>
<namePart type="family">Logacheva</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Abhik</namePart>
<namePart type="family">Jana</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Dmitry</namePart>
<namePart type="family">Ustalov</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Peter</namePart>
<namePart type="family">Jansen</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Mexico City, Mexico</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>Readability or difficulty estimation of words and documents has been investigated independently in the literature, often assuming the existence of extensive annotated resources for the other. Motivated by our analysis showing that there is a recursive relationship between word and document difficulty, we propose to jointly estimate word and document difficulty through a graph convolutional network (GCN) in a semi-supervised fashion. Our experimental results reveal that the GCN-based method can achieve higher accuracy than strong baselines, and stays robust even with a smaller amount of labeled data.</abstract>
<identifier type="citekey">fujinuma-hagiwara-2021-semi</identifier>
<identifier type="doi">10.18653/v1/2021.textgraphs-1.16</identifier>
<location>
<url>https://aclanthology.org/2021.textgraphs-1.16</url>
</location>
<part>
<date>2021-06</date>
<extent unit="page">
<start>150</start>
<end>155</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Semi-Supervised Joint Estimation of Word and Document Readability
%A Fujinuma, Yoshinari
%A Hagiwara, Masato
%Y Panchenko, Alexander
%Y Malliaros, Fragkiskos D.
%Y Logacheva, Varvara
%Y Jana, Abhik
%Y Ustalov, Dmitry
%Y Jansen, Peter
%S Proceedings of the Fifteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-15)
%D 2021
%8 June
%I Association for Computational Linguistics
%C Mexico City, Mexico
%F fujinuma-hagiwara-2021-semi
%X Readability or difficulty estimation of words and documents has been investigated independently in the literature, often assuming the existence of extensive annotated resources for the other. Motivated by our analysis showing that there is a recursive relationship between word and document difficulty, we propose to jointly estimate word and document difficulty through a graph convolutional network (GCN) in a semi-supervised fashion. Our experimental results reveal that the GCN-based method can achieve higher accuracy than strong baselines, and stays robust even with a smaller amount of labeled data.
%R 10.18653/v1/2021.textgraphs-1.16
%U https://aclanthology.org/2021.textgraphs-1.16
%U https://doi.org/10.18653/v1/2021.textgraphs-1.16
%P 150-155
Markdown (Informal)
[Semi-Supervised Joint Estimation of Word and Document Readability](https://aclanthology.org/2021.textgraphs-1.16) (Fujinuma & Hagiwara, TextGraphs 2021)
ACL