Question-Driven Span Labeling Model for Aspect–Opinion Pair Extraction

نویسندگان

چکیده

Aspect term extraction and opinion word are two fundamental subtasks of aspect-based sentiment analysis. The internal relationship between aspect terms words is typically ignored, information for the decision-making buyers sellers insufficient. In this paper, we explore an aspect–opinion pair (AOPE) task propose a Question-Driven Span Labeling (QDSL) model to extract all pairs from user-generated reviews. Specifically, divide AOPE into (ATE) aspect-specified (ASOE) subtasks; first candidate then corresponding given term. Unlike existing approaches that use BIO-based tagging scheme extraction, QDSL adopts span-based builds question–answer-based machine-reading comprehension effective extraction. Extensive experiments conducted on three tasks (ATE, ASOE, AOPE) four benchmark datasets demonstrate proposed method significantly outperforms state-of-the-art approaches.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Super Pair Sum Labeling of Graphs

Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...

متن کامل

Edge pair sum labeling of spider graph

An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...

متن کامل

Using Generalized Language Model for Question Matching

Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...

متن کامل

Minimal Span Weighting Retrieval for Question Answering

Current question answering systems rely on document retrieval as a means of providing documents which are likely to contain an answer to a user’s question. Recent research has shown that taking into account the proximity between question terms is helpful in determining whether a document contains an answer to a question. In this paper, we propose a novel proximity-based approach to document ret...

متن کامل

Edge pair sum labeling of some cycle related graphs

Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i14.17523