Character based String Kernels for Bio-Entity Relation Detection
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingQuestion AnsweringRelationRelation ExtractionSimilar Papers 제목 키워드 기반
Optimal Transport-based Alignment of Learned Character Representations for String Similarity
String similarity models are vital for record linkage, entity resolution, and search. In this work, we present STANCE --a learned model for computing the similarity of two strings. Our approach encodes the characters of …
Entity ResolutionAutomated essay scoring with string kernels and word embeddings
In this work, we present an approach based on combining string kernels and word embeddings for automatic essay scoring. String kernels capture the similarity among strings based on counting common character n-grams, whic…
Automated Essay ScoringDialect IdentificationGeneral ClassificationLanguage Identification+4Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve theoretical complexity bounds of existing …
General ClassificationGenre classificationMusic Genre ClassificationCharacter-level Deep Conflation for Business Data Analytics
Connecting different text attributes associated with the same entity (conflation) is important in business data analytics since it could help merge two different tables in a database to provide a more comprehensive profi…
Space-efficient Feature Maps for String Alignment Kernels
String kernels are attractive data analysis tools for analyzing string data. Among them, alignment kernels are known for their high prediction accuracies in string classifications when tested in combination with SVM in v…