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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Yung Tack Kim

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

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

Artificial intelligence and machine learning · 1

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
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › text segmentation
sentence segmentation		 0.012000
Reducing Parsing Complexity by Intra-Sentence Segmentation based on Maximum Entropy Model · EMNLP 2000
Natural language and speech › Information extraction and text analysis
syntactic parsing		 0.012000
Reducing Parsing Complexity by Intra-Sentence Segmentation based on Maximum Entropy Model · EMNLP 2000

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

maximum entropy model · 0.0
YearPublicationVenuePosition
2000 Reducing Parsing Complexity by Intra-Sentence Segmentation based on Maximum Entropy Model
abstract
Long sentence analysis has been a critical problem because of high complexity. This paper addresses the reduction of parsing complexity by intra-sentence segmentation, and presents maximum entropy model for determining segmentation positions. The model features lexical contexts of segmentation positions, giving a probability to each potential position. Segmentation coverage and accuracy of the proposed method are 96% and 88% respectively. The parsing efficiency is improved by 77% in time and 71% in space.
Sung Dong Kim, Byoung-Tak Zhang, Yung Tack Kim
 EMNLP3