Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2312.00688v1

Help | Advanced Search

Computer Science > Computation and Language

arXiv:2312.00688v1 (cs)
[Submitted on 1 Dec 2023 ]

Title: Towards Transparency in Coreference Resolution: A Quantum-Inspired Approach

Title: 迈向共指消解的透明性:一种量子启发的方法

Authors:Hadi Wazni, Mehrnoosh Sadrzadeh
Abstract: Guided by grammatical structure, words compose to form sentences, and guided by discourse structure, sentences compose to form dialogues and documents. The compositional aspect of sentence and discourse units is often overlooked by machine learning algorithms. A recent initiative called Quantum Natural Language Processing (QNLP) learns word meanings as points in a Hilbert space and acts on them via a translation of grammatical structure into Parametrised Quantum Circuits (PQCs). Previous work extended the QNLP translation to discourse structure using points in a closure of Hilbert spaces. In this paper, we evaluate this translation on a Winograd-style pronoun resolution task. We train a Variational Quantum Classifier (VQC) for binary classification and implement an end-to-end pronoun resolution system. The simulations executed on IBMQ software converged with an F1 score of 87.20%. The model outperformed two out of three classical coreference resolution systems and neared state-of-the-art SpanBERT. A mixed quantum-classical model yet improved these results with an F1 score increase of around 6%.
Abstract: 基于语法结构,单词组成句子,而基于话语结构,句子组成对话和文档。 句子和话语单元的组合方面常常被机器学习算法所忽视。 最近一项名为量子自然语言处理(QNLP)的举措将词义作为希尔伯特空间中的点,并通过将语法结构转化为参数化量子电路(PQCs)来作用于它们。 先前的工作使用希尔伯特空间的闭包中的点,将QNLP的翻译扩展到话语结构。 在本文中,我们在一个Winograd风格的代词消解任务上评估了这种翻译。 我们训练了一个变分量子分类器(VQC)进行二分类,并实现了一个端到端的代词消解系统。 在IBMQ软件上执行的模拟达到了87.20%的F1分数。 该模型优于三个经典共指解析系统中的两个,并接近最先进的SpanBERT。 一种混合量子-经典模型进一步提高了这些结果,F1分数增加了约6%。
Comments: CRAC 2023, the Sixth Workshop on Computational Models of Reference, Anaphora and Coreference, EMNLP 2023
Subjects: Computation and Language (cs.CL) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Logic in Computer Science (cs.LO)
Cite as: arXiv:2312.00688 [cs.CL]
  (or arXiv:2312.00688v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2312.00688
arXiv-issued DOI via DataCite

Submission history

From: Hadi Wazni [view email]
[v1] Fri, 1 Dec 2023 16:11:38 UTC (316 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.CL
< prev   |   next >
new | recent | 2023-12
Change to browse by:
cs
cs.AI
cs.LG
cs.LO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号