Query parsing using probabilistic tree grammars

Please use this identifier to cite or link to this item: http://hdl.handle.net/10045/25105
Información del item - Informació de l'item - Item information
Title: Query parsing using probabilistic tree grammars
Authors: Bernabeu Briones, José Francisco | Calera Rubio, Jorge | Iñesta, José M. | Rizo, David
Research Group/s: Reconocimiento de Formas e Inteligencia Artificial
Center, Department or Service: Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos
Keywords: Probabilistic tree grammars | Query parsing | Melodic similarity computation
Knowledge Area: Lenguajes y Sistemas Informáticos
Issue Date: 30-Jun-2012
Abstract: The tree representation, using rhythm for defining the tree structure and pitch information for node labeling has proven to be effective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we infer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format.
Description: Appearing in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, Scotland, UK, 2012.
URI: http://hdl.handle.net/10045/25105
Language: eng
Type: info:eu-repo/semantics/conferenceObject
Peer Review: si
Appears in Collections:INV - GRFIA - Comunicaciones a Congresos, Conferencias, etc.

Files in This Item:
Files in This Item:
File Description SizeFormat 
Thumbnailmml2012.pdf202,01 kBAdobe PDFOpen Preview


Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.