| Título |
Semantic loss in autoencoder tree reconstruction based on different tuple-based algorithms |
| Tipo |
Congreso |
| Sub-tipo |
Memoria |
| Descripción |
6th International Workshop on Artificial Intelligence and Pattern Recognition, IWAIPR 2018 |
| Resumen |
Current natural language processing analysis is mainly based on two different kinds of representation: structured data or word embeddings (WE). Modern applications also develop some kind of processing after based on these latter representations. Several works choose to structure data by building WE-based semantic trees that hold the maximum amount of semantic information. Many different approaches have been explores, but only a few comparisons have been performed. In this work we developed a compatible tuple base representation for Stanford dependency trees that allows us to compared two different ways of constructing tuples. Our measures mainly comprise tree reconstruction error, mean error over batches of given trees and performance on training stage. © Springer Nature Switzerland AG 2018. |
| Observaciones |
DOI 10.1007/978-3-030-01132-1_20, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), V. 11047 |
| Lugar |
Habana |
| País |
Cuba |
| No. de páginas |
174-181 |
| Vol. / Cap. |
11047 LNCS |
| Inicio |
2018-09-24 |
| Fin |
2018-09-26 |
| ISBN/ISSN |
9783030011314 |
