paper-with-me

Papers

To Sing like a Mockingbird

2017-04-01 · EACL 2017 4 · Lorenzo Gatti, G{\"o}zde {\"O}zbal, Oliviero Stock, Carlo Strapparava

Musical parody, i.e. the act of changing the lyrics of an existing and very well-known song, is a commonly used technique for creating catchy advertising tunes and for mocking people or events. Here we describe a system for automatically producing a musical parody, starting from a corpus of songs. The system can automatically identify characterizing words and concepts related to a novel text, which are taken from the daily news. These concepts are then used as seeds to appropriately replace part of the original lyrics of a song, using metrical, rhyming and lexical constraints. Finally, the parody can be sung with a singing speech synthesizer, with no intervention from the user.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Mockingbird: How does LLM perform in general machine learning tasks?

2025-08-06 · Haoyu Jia, Yoshiki Obinata, Kento Kawaharazuka, Kei Okada arxiv

Large language models (LLMs) are now being used with increasing frequency as chat bots, tasked with the summarizing information or generating text and code in accordance with user instructions. The rapid increase in reas…

Mockingbird at the SIGTYP 2022 Shared Task: Two Types of Models forthe Prediction of Cognate Reflexes

2022-07-01 · NAACL (SIGTYP) 2022 7 · Christo Kirov, Richard Sproat, Alexander Gutkin

The SIGTYP 2022 shared task concerns the problem of word reflex generation in a target language, given cognate words from a subset of related languages. We present two systems to tackle this problem, covering two very di…

DecoderImage Restoration

MLE-induced Likelihood for Markov Random Fields

2018-03-27 · Jie Liu, Hao Zheng

Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace …

Composite Likelihood Estimation for Restricted Boltzmann machines

2014-06-24 · Muneki Yasuda, Shun Kataoka, Yuji Waizumi, Kazuyuki Tanaka

Learning the parameters of graphical models using the maximum likelihood estimation is generally hard which requires an approximation. Maximum composite likelihood estimations are statistical approximations of the maximu…

Inferring User Preferences by Probabilistic Logical Reasoning over Social Networks

2014-11-11 · Jiwei Li, Alan Ritter, Dan Jurafsky

We propose a framework for inferring the latent attitudes or preferences of users by performing probabilistic first-order logical reasoning over the social network graph. Our method answers questions about Twitter users …

AttributeLogical ReasoningRelation Extraction