Name
Abstract | ||
|---|---|---|
Recent advances in music information retrieval have en- abled users to query a database by singing or humming into a microphone. The queries are often inaccurate ver- sions of the original songs due to singing errors and errors introduced in the music transcription process. In this pa- per, we present the Time-Warped Longest Common Sub- sequence algorithm (T-WLCS), which deals with singing errors involving rhythmic distortions. The algorithm is employed on song retrieval tasks, where its performance is compared to the longest common subsequence algorithm. |
Year | Venue | Keywords |
|---|---|---|
2004 | ISMIR 2013 | longest common subsequence |
Field | DocType | Citations |
Music information retrieval,Longest common subsequence problem,Computer science,Algorithm,Speech recognition,Singing,Hum,Rhythm,Microphone | Conference | 23 |
PageRank | References | Authors |
1.47 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| An-Yuan Guo | 1 | 74 | 5.08 |
| Hava T. Siegelmann | 2 | 980 | 145.09 |