| 1 |
Paraphrase-Based Models Of Lexical Semantics
|
|
|
|
In: Publicly Accessible Penn Dissertations (2019)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Paraphrase-based Models of Lexical Semantics
|
|
|
|
In: Dissertations available from ProQuest (2019)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Paraphrase-Sense-Tagged Sentences
|
|
|
|
In: Transactions of the Association for Computational Linguistics, Vol 7, Pp 714-728 (2019) (2019)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Automated Paraphrase Lattice Creation for HyTER Machine Translation Evaluation
|
|
|
|
In: Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies ; https://hal.archives-ouvertes.fr/hal-01838521 ; Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics Jun 2018, Nouvelle Orléans, United States (2018)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Comparing Constraints for Taxonomic Organization
|
|
|
|
In: Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies ; https://hal.archives-ouvertes.fr/hal-01838520 ; Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics Jun 2018, Nouvelle Orléans, United States (2018)
|
|
Abstract:
International audience ; Building a taxonomy from the ground up involves several sub-tasks: selecting terms to include, predicting semantic relations between terms, and selecting a subset of relational instances to keep, given constraints on the taxonomy graph. Methods for this final step – taxonomic organization – vary both in terms of the constraints they impose, and whether they enable discovery of synonymous terms. It is hard to isolate the impact of these factors on the quality of the resulting taxonomy because organization methods are rarely compared directly. In this paper, we present a head-to-head comparison of six taxonomic organization algorithms that vary with respect to their structural and transitivity constraints, and treatment of synonymy. We find that while transitive algorithms out-perform their non-transitive counterparts, the top-performing transitive algorithm is prohibitively slow for taxonomies with as few as 50 entities. We propose a simple modification to a non-transitive optimum branching algorithm to explicitly incorporate synonymy, resulting in a method that is substantially faster than the best transitive algorithm while giving complementary performance.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; [INFO]Computer Science [cs]; paraphrases; taxonomy
|
|
URL: https://hal.archives-ouvertes.fr/hal-01838520
|
|
BASE
|
|
Hide details
|
|
|
| 6 |
Mapping the Paraphrase Database to WordNet
|
|
|
|
In: Conference on Lexical and Computational Semantics ; https://hal.archives-ouvertes.fr/hal-01838527 ; Conference on Lexical and Computational Semantics, Aug 2017, Vancouver, Canada (2017)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Word Sense Filtering Improves Embedding-Based Lexical Substitution
|
|
|
|
In: Conference of the European Chapter of the Association for Computational Linguistics ; https://hal.archives-ouvertes.fr/hal-01838524 ; Conference of the European Chapter of the Association for Computational Linguistics , Apr 2017, Valencia, Spain (2017)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
KnowYourNyms? A Game of Semantic Relationships
|
|
|
|
In: Conference on Empirical Methods in Natural Language Processing ; https://hal.archives-ouvertes.fr/hal-01838528 ; Conference on Empirical Methods in Natural Language Processing, Sep 2017, Copenhagen, Denmark (2017)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Deep learning for pharmacovigilance: recurrent neural network architectures for labeling adverse drug reactions in Twitter posts
|
|
|
|
In: J Am Med Inform Assoc (2017)
|
|
BASE
|
|
Show details
|
|
|
|
|
