1 |
Multilingual Unsupervised Sentence Simplification
|
|
|
|
In: https://hal.inria.fr/hal-03109299 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
2 |
Controllable Sentence Simplification
|
|
|
|
In: LREC 2020 - 12th Language Resources and Evaluation Conference ; https://hal.inria.fr/hal-02678214 ; LREC 2020 - 12th Language Resources and Evaluation Conference, May 2020, Marseille, France ; http://www.lrec-conf.org/proceedings/lrec2020/index.html (2020)
|
|
BASE
|
|
Show details
|
|
3 |
ASSET: A Dataset for Tuning and Evaluation of Sentence Simplification Models with Multiple Rewriting Transformations
|
|
|
|
In: ACL 2020 - 58th Annual Meeting of the Association for Computational Linguistics ; https://hal.inria.fr/hal-02889823 ; ACL 2020 - 58th Annual Meeting of the Association for Computational Linguistics, Jul 2020, Seattle / Virtual, United States (2020)
|
|
BASE
|
|
Show details
|
|
4 |
Augmenting Transformers with KNN-Based Composite Memory for Dialog
|
|
|
|
In: EISSN: 2307-387X ; Transactions of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-02999678 ; Transactions of the Association for Computational Linguistics, The MIT Press, In press, ⟨10.1162/tacl_a_00356⟩ ; https://transacl.org/index.php/tacl (2020)
|
|
BASE
|
|
Show details
|
|
5 |
MUSS: Multilingual Unsupervised Sentence Simplification by Mining Paraphrases ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
ASSET: A Dataset for Tuning and Evaluation of Sentence Simplification Models with Multiple Rewriting Transformations ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
ASSET: A dataset for tuning and evaluation of sentence simplification models with multiple rewriting transformations
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Controllable Sentence Simplification
|
|
|
|
In: https://hal.inria.fr/hal-02445874 ; 2019 (2019)
|
|
BASE
|
|
Show details
|
|
10 |
Reference-less Quality Estimation of Text Simplification Systems
|
|
|
|
In: 1st Workshop on Automatic Text Adaptation (ATA) ; https://hal.inria.fr/hal-01959054 ; 1st Workshop on Automatic Text Adaptation (ATA), Nov 2018, Tilburg, Netherlands ; https://www.ida.liu.se/~evere22/ATA-18/ (2018)
|
|
BASE
|
|
Show details
|
|
11 |
Fader Networks: Manipulating Images by Sliding Attributes
|
|
|
|
In: 31st Conference on Neural Information Processing Systems (NIPS 2017) ; https://hal.archives-ouvertes.fr/hal-02275215 ; 31st Conference on Neural Information Processing Systems (NIPS 2017), Dec 2017, Long Beach, CA, United States. pp.5969-5978 (2017)
|
|
BASE
|
|
Show details
|
|
12 |
Extracting biomedical events from pairs of text entities
|
|
|
|
In: ISSN: 1471-2105 ; BMC Bioinformatics ; https://hal.archives-ouvertes.fr/hal-01313324 ; BMC Bioinformatics, BioMed Central, 2015, 16 (Suppl 10), pp.S8. ⟨10.1186/1471-2105-16-S10-S8⟩ ; http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-16-S10-S8 (2015)
|
|
BASE
|
|
Show details
|
|
13 |
Open Question Answering with Weakly Supervised Embedding Models
|
|
|
|
In: European Conference (ECML PKDD 2014) ; https://hal.archives-ouvertes.fr/hal-01344007 ; European Conference (ECML PKDD 2014), Sep 2014, nancy, France. pp.165-180, ⟨10.1007/978-3-662-44848-9_11⟩ (2014)
|
|
BASE
|
|
Show details
|
|
14 |
Fast recursive multi-class classification of pairs of text entities for biomedical event extraction
|
|
|
|
In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-01060830 ; Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, Apr 2014, Gothenburg, Sweden. pp.692--701 (2014)
|
|
Abstract:
International audience ; Extracting biomedical events from scientific articles to automatically update dedicated knowledge bases has become a popular research topic with important applications. Most existing approaches are either pipeline models of specific classifiers, usually subject to cascading errors, or joint structured models, more efficient but also more costly and complicated to train. This paper proposes a system based on a pairwise model that transforms event extraction into a simple multi-class problem of classifying pairs of text entities. Such pairs are recursively provided to the classifier, allowing to extract events involving other events as arguments. This model facilitates inference compared to joint models while % relying on a single main classifier compared to being more direct and efficient than usual pipeline approaches. This method yields the best results reported so far on the BioNLP 2011 and 2013 Genia tasks.
|
|
Keyword:
[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]
|
|
URL: https://hal.archives-ouvertes.fr/hal-01060830/file/document.pdf https://hal.archives-ouvertes.fr/hal-01060830 https://hal.archives-ouvertes.fr/hal-01060830/document
|
|
BASE
|
|
Hide details
|
|
15 |
Open Question Answering with Weakly Supervised Embedding Models ...
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Towards Understanding Situated Natural Language
|
|
|
|
In: 13th International Conference on Artificial Intelligence and Statistics ; https://hal.archives-ouvertes.fr/hal-00750937 ; 13th International Conference on Artificial Intelligence and Statistics, May 2010, Chia Laguna Resort, Sardinia, Italy. pp.65-72 (2010)
|
|
BASE
|
|
Show details
|
|
17 |
Extracting biomedical events from pairs of text entities
|
|
|
|
In: ISSN: 1471-2105 ; BMC Bioinformatics ; https://hal.archives-ouvertes.fr/hal-01278279 ; BMC Bioinformatics, BioMed Central, 2005, 16 (Suppl 10), pp.S8. ⟨10.1186/1471-2105-16-S10-S8⟩ ; http://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-16-S10-S8 (2005)
|
|
BASE
|
|
Show details
|
|
|
|