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

Lev-Arie Ratinov

dblp:05/3325 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 13 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Databases, data management, data science and information retrieval · 1 · 1 first-author

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
6 papers
Information extraction and text analysis · 48% Transfer learning and domain adaptation · 16% Representation and self-supervised learning · 10%
Theoretical computer science
1 paper
Computational complexity · 100%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
text classification
0.222008
Text Categorization with Knowledge Transfer from Heterogeneous Data Sources · AAAI 2008
Importance of Semantic Representation: Dataless Classification · AAAI 2008
Natural language and speech › Information extraction and text analysis
coreference resolution
0.112012
Learning-based Multi-Sieve Co-reference Resolution with Knowledge · EMNLP-CoNLL 2012
Natural language and speech › Information extraction and text analysis › entity linking
entity disambiguation
0.112011
Local and Global Algorithms for Disambiguation to Wikipedia · ACL 2011
Machine learning › Learning paradigms
semi-supervised learning
0.112010
Word Representations: A Simple and General Method for Semi-Supervised Learning · ACL 2010
Machine learning › Representation and self-supervised learning
word representation
0.112010
Word Representations: A Simple and General Method for Semi-Supervised Learning · ACL 2010
Machine learning › Reinforcement learning › imitation learning › inverse reinforcement learning
constraint inference
0.112008
Learning and Inference with Constraints · AAAI 2008
Machine learning › Transfer learning and domain adaptation › cross-domain learning
cross-domain text classification
0.112008
Text Categorization with Knowledge Transfer from Heterogeneous Data Sources · AAAI 2008
Natural language and speech › Information extraction and text analysis › text classification › transfer learning for text classification
dataless classification
0.112008
Importance of Semantic Representation: Dataless Classification · AAAI 2008
Machine learning › Transfer learning and domain adaptation › domain adaptation
heterogeneous domain adaptation
0.112008
Text Categorization with Knowledge Transfer from Heterogeneous Data Sources · AAAI 2008
Knowledge, reasoning and agents › Knowledge representation and reasoning
semantic representation
0.112008
Importance of Semantic Representation: Dataless Classification · AAAI 2008
Computational complexity
constraint satisfaction
0.112008
Learning and Inference with Constraints · AAAI 2008

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

local and global algorithms · 0.2multi-sieve · 0.1knowledge · 0.1word embeddings · 0.1knowledge transfer · 0.1
YearPublicationVenuePosition
2018 CogCompNLP: Your Swiss Army Knife for NLP
Daniel Khashabi, Mark Sammons, Ben Zhou, Tom Redman, Christos Christodoulopoulos 0001, Vivek Srikumar, Nick Rizzolo, Lev-Arie Ratinov, Guanheng Luo, Quang Do, Chen-Tse Tsai, Subhro Roy, Stephen Mayhew 0001, Zhili Feng, John Wieting, Xiaodong Yu 0003, Yangqiu Song, Shashank Gupta 0007, Shyam Upadhyay, Naveen Arivazhagan, Qiang Ning, Shaoshi Ling, Dan Roth 0001
LREC8
2012 Analysis and Enhancement of Wikification for Microblogs with Context Expansion
Taylor Cassidy, Heng Ji 0001, Lev-Arie Ratinov, Arkaitz Zubiaga, Hongzhao Huang
COLING3
2012 Learning-based Multi-Sieve Co-reference Resolution with Knowledge
Lev-Arie Ratinov, Dan Roth 0001
EMNLP-CoNLL1
2012 Structured learning with constrained conditional models
Ming-Wei Chang, Lev-Arie Ratinov, Dan Roth 0001
Mach. Learn.2
2011 Local and Global Algorithms for Disambiguation to Wikipedia
Lev-Arie Ratinov, Dan Roth 0001, Doug Downey
ACL1
2010 Word Representations: A Simple and General Method for Semi-Supervised Learning
Joseph P. Turian, Lev-Arie Ratinov, Yoshua Bengio
ACL2
2009 Design Challenges and Misconceptions in Named Entity Recognition
Lev-Arie Ratinov, Dan Roth 0001
CoNLL1
2008 Learning and Inference with Constraints
Ming-Wei Chang, Lev-Arie Ratinov, Nick Rizzolo, Dan Roth 0001
AAAI2
2008 Importance of Semantic Representation: Dataless Classification
Ming-Wei Chang, Lev-Arie Ratinov, Dan Roth 0001, Vivek Srikumar
AAAI2
2008 Text Categorization with Knowledge Transfer from Heterogeneous Data Sources
Rakesh Gupta 0001, Lev-Arie Ratinov
AAAI2
2008 Learning to Shift the Polarity of Words for Sentiment Classification
Daisuke Ikeda, Hiroya Takamura, Lev-Arie Ratinov, Manabu Okumura
IJCNLP3
2007 Guiding Semi-Supervision with Constraint-Driven Learning
Ming-Wei Chang, Lev-Arie Ratinov, Dan Roth 0001
ACL2
2004 Abbreviation Expansion in Schema Matching and Web Integration
abstract
Schema matching is a problem of finding correspondences, particularly equivalence relationships across schemas. The problem has a particular significance in integrating web repositories, as distributed databases over the web becomes increasingly popular. Most of the existing prototypes use schema level lexical information for schema matching. However, most of them perform rather poorly on real-world problems due to the abundance of abbreviations in real-world schemas. For example, none of the lexical matchers we tested would recommend a mapping of 'cnum' to 'cid', while 'customer number' and 'customer ID' are matching entities. In this work we propose a method for abbreviation expansion in schemas that facilitates lexical schema matching.
Lev-Arie Ratinov, Ehud Gudes
Web Intelligence1