Daniel Fernández-González

Dr. Daniel Fernández-González

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2022 in Knowledge-Based Systems
Verified
Journal Article
Open access
DFDaniel Fernández-González
Daniel Fernández-González
Carlos Gómez-RodríguezCarlos Gómez-Rodríguez
Carlos Gómez-Rodríguez

28 October 2022 in Information Fusion
Verified
Journal Article
Open access
DFDaniel Fernández-González
Daniel Fernández-González
Carlos Gómez-RodríguezCarlos Gómez-Rodríguez
Carlos Gómez-Rodríguez

21 November 2022 in Knowledge-Based Systems
Verified
Journal Article
Open access
DFDaniel Fernández-González
Daniel Fernández-González

10 January 2026 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
DFDaniel Fernández-González
Daniel Fernández-González
Structured sentiment analysis (SSA) aims to automatically extract people’s opinions from a text in natural language and adequately represent that information in a graph structure. One of the most accurate methods for performing SSA was recently proposed and consists of approaching it as a dependency graph parsing task. Although we can find in the literature how transition-based algorithms excel in different dependency graph parsing tasks in terms of accuracy and efficiency, all proposed attempts to tackle SSA following that approach were based on graph-based models. In this article, we present the first transition-based method to address SSA as dependency graph parsing. Specifically, we design a transition system that processes the input text in a left-to-right pass, incrementally generating the graph structure containing all identified opinions. To effectively implement our final transition-based model, we resort to a Pointer Network architecture as a backbone. From an extensive evaluation, we demonstrate that our model offers the best performance to date in practically all cases among prior dependency-based methods, and surpasses recent task-specific techniques on the most challenging datasets. We additionally include an in-depth analysis and empirically prove that the average-case time complexity of our approach is quadratic in the sentence length, being more efficient than top-performing graph-based parsers.

22 August 2024 in Cognitive Computation
Verified
Journal Article
Open access
PDF file
DFDaniel Fernández-González
Daniel Fernández-González
Intelligent voice assistants, such as Apple Siri and Amazon Alexa, are widely used nowadays. These task-oriented dialogue systems require a semantic parsing module in order to process user utterances and understand the action to be performed. This semantic parsing component was initially implemented by rule-based or statistical slot-filling approaches for processing simple queries; however, the appearance of more complex utterances demanded the application of shift-reduce parsers or sequence-to-sequence models. Although shift-reduce approaches were initially considered the most promising option, the emergence of sequence-to-sequence neural systems has propelled them to the forefront as the highest-performing method for this particular task. In this article, we advance the research on shift-reduce semantic parsing for task-oriented dialogue. We implement novel shift-reduce parsers that rely on Stack-Transformers. This framework allows to adequately model transition systems on the transformer neural architecture, notably boosting shift-reduce parsing performance. Furthermore, our approach goes beyond the conventional top-down algorithm: we incorporate alternative bottom-up and in-order transition systems derived from constituency parsing into the realm of task-oriented parsing. We extensively test our approach on multiple domains from the Facebook TOP benchmark, improving over existing shift-reduce parsers and state-of-the-art sequence-to-sequence models in both high-resource and low-resource settings. We also empirically prove that the in-order algorithm substantially outperforms the commonly used top-down strategy. Through the creation of innovative transition systems and harnessing the capabilities of a robust neural architecture, our study showcases the superiority of shift-reduce parsers over leading sequence-to-sequence methods on the main benchmark.

30 April 2023 in EYA ACADEMY
Verified
Journal Article
Closed access
KZKarla Sofía Sánchez Zambrano
Karla Sofía Sánchez Zambrano
U(Universidad Autónoma de Nuevo León (Uanl)
Universidad Autónoma de Nuevo León (Uanl)
MHMarina Hernández-Resendiz
Marina Hernández-Resendiz
Cristian Gómez-RodríguezCristian Gómez-Rodríguez
Cristian Gómez-Rodríguez
LGLinda Viviana García-Quiñonez
Linda Viviana García-Quiñonez
C(Consejo Superior de Investigaciones Científicas (Csic) Centro de Investigación En Nanomateriales Y Nanotecnología (Cinn)
Consejo Superior de Investigaciones Científicas (Csic) Centro de Investigación En Nanomateriales Y Nanotecnología (Cinn)
En este trabajo, se estudiaron las fases en el sistema Mg-Ti-O utilizando la formulación 1:1 de MgO:TiO2 mezclando brucita sintética de origen mexicano con micropartículas de TiO2 de alta pureza y con un tratamiento térmico a 1100°C durante 1 h. Debido a sus electrones de valencia, el TiO2 puede contribuir al proceso de sinterización para mejorar la densidad en los productos de MgO. Las materias primas y la formulación se caracterizaron por las técnicas XPS y XRD. Los resultados demuestran la presencia de diferentes estados de oxidación en la titania y la formación de diferentes óxidos en el sistema Mg-Ti-O cuando se mezcla y calcina a 1100°C. A partir de entonces, se estima la formación de vacantes en la red cristalina durante la transformación de brucita hexagonal a magnesia con una estructura cúbica centrada en las caras. Con los resultados, se advierte su comportamiento térmico en base al diagrama de fases MgO-TiO2.