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

Iryna Haponchyk

dblp:203/9515 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 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
2 papers
Information extraction and text analysis · 62% Probabilistic and Bayesian machine learning · 19% Learning theory · 19%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
supervised clustering
0.312018
Supervised Clustering of Questions into Intents for Dialog System Applications · EMNLP 2018
Natural language and speech › Information extraction and text analysis › text mining
text clustering
0.312018
Supervised Clustering of Questions into Intents for Dialog System Applications · EMNLP 2018
Natural language and speech › Information extraction and text analysis
coreference resolution
0.312017
Don't understand a measure? Learn it: Structured Prediction for Coreference Resolution optimizing its measures · ACL (1) 2017
Machine learning › Learning theory
loss function
0.312017
Don't understand a measure? Learn it: Structured Prediction for Coreference Resolution optimizing its measures · ACL (1) 2017
Machine learning › Probabilistic and Bayesian machine learning
structured prediction
0.312017
Don't understand a measure? Learn it: Structured Prediction for Coreference Resolution optimizing its measures · ACL (1) 2017

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

structured output · 0.3semantic classifier · 0.3structured prediction · 0.3loss-augmented inference · 0.3
YearPublicationVenuePosition
2021 Supervised Neural Clustering via Latent Structured Output Learning: Application to Question Intents
abstract
Previous pre-neural work on structured prediction has produced very effective supervised clustering algorithms using linear classifiers, e.g., structured SVM or perceptron.However, these cannot exploit the representation learning ability of neural networks, which would make supervised clustering even more powerful, i.e., general clustering patterns can be learned automatically.In this paper, we design neural networks based on latent structured prediction loss and Transformer models to approach supervised clustering.We tested our methods on the task of automatically recreating categories of intents from publicly available question intent corpora.The results show that our approach delivers 95.65% of F1, outperforming the state of the art by 17.24%.
Iryna Haponchyk, Alessandro Moschitti
NAACL-HLT1
2018 Supervised Clustering of Questions into Intents for Dialog System Applications
abstract
Modern automated dialog systems require complex dialog managers able to deal with user intent triggered by high-level semantic questions.In this paper, we propose a model for automatically clustering questions into user intents to help the design tasks.Since questions are short texts, uncovering their semantics to group them together can be very challenging.We approach the problem by using powerful semantic classifiers from question duplicate/matching research along with a novel idea of supervised clustering methods based on structured output.We test our approach on two intent clustering corpora, showing an impressive improvement over previous methods for two languages/domains.
Iryna Haponchyk, Antonio Uva 0001, Seunghak Yu, Olga Uryupina, Alessandro Moschitti
EMNLP1
2017 Don't understand a measure? Learn it: Structured Prediction for Coreference Resolution optimizing its measures
abstract
An assential aspect of structured prediction is the evaluation of an output structure against the gold standard.Especially in the loss-augmented setting, the need of finding the max-violating constraint has severely limited the expressivity of effective loss functions.In this paper, we trade off exact computation for enabling the use of more complex loss functions for coreference resolution (CR).Most noteworthily, we show that such functions can be (i) automatically learned also from controversial but commonly accepted CR measures, e.g., MELA, and (ii) successfully used in learning algorithms.The accurate model comparison on the standard CoNLL-2012 setting shows the benefit of more expressive loss for Arabic and English data.
Iryna Haponchyk, Alessandro Moschitti
ACL (1)1