中文
相关论文

相关论文: A complexity measure for diachronic Chinese phonol…

200 篇论文

Automated metrics for Machine Translation have made significant progress, with the goal of replacing expensive and time-consuming human evaluations. These metrics are typically assessed by their correlation with human judgments, which…

计算与语言 · 计算机科学 2024-12-31 Pius von Däniken , Jan Deriu , Mark Cieliebak

Chinese dynastic histories form a large continuous linguistic space of approximately 2000 years, from the 3rd century BCE to the 18th century CE. The histories are documented in Classical (Literary) Chinese in a corpus of over 20 million…

计算与语言 · 计算机科学 2020-05-19 Sergey Zinin , Yang Xu

The network characteristics based on the phonological similarities in the lexicons of several languages were examined. These languages differed widely in their history and linguistic structure, but commonalities in the network…

物理与社会 · 物理学 2015-05-13 Samuel Arbesman , Steven H. Strogatz , Michael S. Vitevitch

Large Language Models (LLMs) have made significant strides in natural language generation but often face challenges in tasks requiring precise calculations and structural analysis. This paper investigates the performance of state-of-the-art…

计算与语言 · 计算机科学 2025-02-18 Birger Moell , Johan Boye

In this paper, we focus on studying robustness evaluation of Chinese question matching. Most of the previous work on analyzing robustness issue focus on just one or a few types of artificial adversarial examples. Instead, we argue that it…

计算与语言 · 计算机科学 2022-05-26 Hongyu Zhu , Yan Chen , Jing Yan , Jing Liu , Yu Hong , Ying Chen , Hua Wu , Haifeng Wang

Phonetic convergence describes the automatic and unconscious speech adaptation of two interlocutors in a conversation. This paper proposes a Siamese recurrent neural network (RNN) architecture to measure the convergence of the holistic…

计算与语言 · 计算机科学 2024-04-05 Zheng Yuan , Aldo Pastore , Dorina de Jong , Hao Xu , Luciano Fadiga , Alessandro D'Ausilio

A longstanding debate in semiotics centers on the relationship between linguistic signs and their corresponding semantics: is there an arbitrary relationship between a word form and its meaning, or does some systematic phenomenon pervade?…

计算与语言 · 计算机科学 2019-07-30 Tiago Pimentel , Arya D. McCarthy , Damián E. Blasi , Brian Roark , Ryan Cotterell

We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the…

量子物理 · 物理学 2007-05-23 Andris Ambainis , Richard Bonner , Rusins Freivalds , Arnolds Kikusts

Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of…

形式语言与自动机理论 · 计算机科学 2014-05-23 Henning Bordihn , Martin Kutrib , Andreas Malcher

The rapid development of such natural language processing tasks as style transfer, paraphrase, and machine translation often calls for the use of semantic similarity metrics. In recent years a lot of methods to measure the semantic…

计算与语言 · 计算机科学 2022-11-15 Ivan P. Yamshchikov , Viacheslav Shibaev , Nikolay Khlebnikov , Alexey Tikhonov

Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…

形式语言与自动机理论 · 计算机科学 2026-01-30 Markel Zubia , Herman Geuvers

Ancient Chinese text processing presents unique challenges for large language models (LLMs) due to its distinct linguistic features, complex structural constraints, and rich cultural context. While existing benchmarks have primarily focused…

计算与语言 · 计算机科学 2025-03-21 Shangqing Zhao , Yuhao Zhou , Yupei Ren , Zhe Chen , Chenghao Jia , Fang Zhe , Zhaogaung Long , Shu Liu , Man Lan

Diacritics are orthographic marks that clarify pronunciation, distinguish similar words, or alter meaning. They play a central role in many writing systems, yet their impact on language technology has not been systematically quantified…

计算与语言 · 计算机科学 2026-03-31 Adi Cohen , Yuval Pinter

Given a set of sequences, the distance between pairs of them helps us to find their similarity and derive structural relationship amongst them. For genomic sequences such measures make it possible to construct the evolution tree of…

信息论 · 计算机科学 2012-08-29 Sandeep Hosangadi

Spoken language proficiency is critically important for children's growth and personal development. Due to the limited and imbalanced educational resources in China, elementary students barely have chances to improve their oral language…

计算与语言 · 计算机科学 2020-01-30 Wenbiao Ding , Guowei Xu , Tianqiao Liu , Weiping Fu , Yujia Song , Chaoyou Guo , Cong Kong , Songfan Yang , Gale Yan Huang , Zitao Liu

One way to resolve the actuation problem of metaphorical language change is to provide a statistical profile of metaphorical constructions and generative rules with antecedent conditions. Based on arguments from the view of language as…

计算与语言 · 计算机科学 2022-11-22 Xuri Tang , Huifang Ye

A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-related…

数据结构与算法 · 计算机科学 2015-03-13 Alexander Tiskin

In this paper we address a method to align English-Chinese bilingual news reports from China News Service, combining both lexical and satistical approaches. Because of the sentential structure differences between English and Chinese,…

cmp-lg · 计算机科学 2008-02-03 Donghua Xu , Chew Lim Tan

The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated…

量子物理 · 物理学 2010-09-20 K. Uyanik , S. Turgut

We study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have…

数据结构与算法 · 计算机科学 2011-03-21 Philip Bille
‹ 上一页 1 8 9 10 下一页 ›