Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shao-Yu Jheng

dblp:344/4156 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Quantifying Character Similarity with Vision Transformers · EMNLP 2023
Bioinformatics and computational biology › sequence analysis
pattern matching
0.712023
Quantifying Character Similarity with Vision Transformers · EMNLP 2023

Methods — techniques the papers use, named apart from their topics

vision transformer · 1.3self-supervised training · 1.3edit distance · 1.3
YearPublicationVenuePosition
2023 Quantifying Character Similarity with Vision Transformers
abstract
Record linkage is a bedrock of quantitative social science, as analyses often require linking data from multiple, noisy sources.Off-theshelf string matching methods are widely used, as they are straightforward and cheap to implement and scale.Not all character substitutions are equally probable, and for some settings there are widely used handcrafted lists denoting which string substitutions are more likely, that improve the accuracy of string matching.However, such lists do not exist for many settings, skewing research with linked datasets towards a few high-resource contexts that are not representative of the diversity of human societies.This study develops an extensible way to measure character substitution costs for OCR'ed documents, by employing large-scale self-supervised training of vision transformers (ViT) with augmented digital fonts.For each language written with the CJK script, we contrastively learn a metric space where different augmentations of the same character are represented nearby.In this space, homoglyphic characters -those with similar appearance such as "O" and "0" -have similar vector representations.Using the cosine distance between characters' representations as the substitution cost in an edit distance matching algorithm significantly improves record linkage compared to other widely used string matching methods, as OCR errors tend to be homoglyphic in nature.Homoglyphs can plausibly capture character visual similarity across any script, including low-resource settings.We illustrate this by creating homoglyph sets for 3,000 year old ancient Chinese characters, which are highly pictorial.Fascinatingly, a ViT is able to capture relationships in how different abstract concepts were conceptualized by ancient societies, that have been noted in the archaeological literature.
Xinmei Yang, Abhishek Arora 0003, Shao-Yu Jheng, Melissa Dell
EMNLP3