A flexible architecture using temporal, spatial and semantic correlation-based algorithms for story segmentation of broadcast news
In this article, we propose a novel flexible architec- ture, with different algorithmic procedures, for effective story segmentation of broadcast news from subtitle files. The proposed system exploits spatial and temporal distance, as well as sentence similarity, to classify different stories in new...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad de Alcalá (UAH) |
| Repositorio: | e_Buah Biblioteca Digital Universidad de Alcalá |
| Idioma: | inglés |
| OAI Identifier: | oai:ebuah.uah.es:10017/60854 |
| Acceso en línea: | http://hdl.handle.net/10017/60854 https://dx.doi.org/10.1109/TASLP.2023.3301231 |
| Access Level: | acceso abierto |
| Palabra clave: | Natural language processing Correlation matrix BERT Video text track Telecomunicaciones Telecommunication |
| Sumario: | In this article, we propose a novel flexible architec- ture, with different algorithmic procedures, for effective story segmentation of broadcast news from subtitle files. The proposed system exploits spatial and temporal distance, as well as sentence similarity, to classify different stories in news broadcasts. The com- putational algorithms which form the architecture mainly focus on each sentence?s features (temporal distance, spatial distance, and semantic similarity), and are combined to build an overall classifier. The first algorithm in the architecture focuses on the segmentation task, detecting boundaries between news. The second and third algorithms identify high semantic correlation between pieces of text, whether they are consecutive in space or not. Video Text Track (VTT) subtitle files are used to evaluate the performance of the proposed approach, although any file format that includes temporal information could also be considered. These VTT files may contain text errors and inaccuracies, and the proposed algorithms have been designed to deal with noisy content. |
|---|