Musical Phrase Segmentation via Grammatical Induction

• URL: http://arxiv.org/abs/2405.18742v1
• Date: Wed, 29 May 2024 04:04:36 GMT
• Title: Musical Phrase Segmentation via Grammatical Induction
• Authors: Reed Perkins, Dan Ventura,
• Abstract summary: We analyze the performance of five grammatical induction algorithms on three datasets using various musical viewpoint combinations. Our experiments show that the LONGESTFIRST algorithm achieves the best F1 scores across all three datasets.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We outline a solution to the challenge of musical phrase segmentation that uses grammatical induction algorithms, a class of algorithms which infer a context-free grammar from an input sequence. We analyze the performance of five grammatical induction algorithms on three datasets using various musical viewpoint combinations. Our experiments show that the LONGESTFIRST algorithm achieves the best F1 scores across all three datasets and that input encodings that include the duration viewpoint result in the best performance.

Related papers

• Grammar Induction from Visual, Speech and Text [91.98797120799227]
  This work introduces a novel visual-audio-text grammar induction task (textbfVAT-GI) Inspired by the fact that language grammar exists beyond the texts, we argue that the text has not to be the predominant modality in grammar induction. We propose a visual-audio-text inside-outside autoencoder (textbfVaTiora) framework, which leverages rich modal-specific and complementary features for effective grammar parsing.
  arXiv  Detail & Related papers  (2024-10-01T02:24:18Z)
• Activity Grammars for Temporal Action Segmentation [71.03141719666972]
  temporal action segmentation aims at translating an untrimmed activity video into a sequence of action segments. This paper introduces an effective activity grammar to guide neural predictions for temporal action segmentation. Experimental results demonstrate that our method significantly improves temporal action segmentation in terms of both performance and interpretability.
  arXiv  Detail & Related papers  (2023-12-07T12:45:33Z)
• DISCO : efficient unsupervised decoding for discrete natural language problems via convex relaxation [1.370633147306388]
  We study test time decoding; an ubiquitous step in almost all sequential text generation task spanning across a wide array of natural language processing (NLP) problems. Our main contribution is to develop a continuous relaxation framework for the NP-hard decoding problem and propose Disco - an efficient algorithm based on standard first order gradient based.
  arXiv  Detail & Related papers  (2021-07-07T00:40:25Z)
• Evaluating Various Tokenizers for Arabic Text Classification [4.110108749051656]
  We introduce three new tokenization algorithms for Arabic and compare them to three other baselines using unsupervised evaluations. Our experiments show that the performance of such tokenization algorithms depends on the size of the dataset, type of the task, and the amount of morphology that exists in the dataset.
  arXiv  Detail & Related papers  (2021-06-14T16:05:58Z)
• Video-aided Unsupervised Grammar Induction [108.53765268059425]
  We investigate video-aided grammar induction, which learns a constituency from both unlabeled text and its corresponding video. Video provides even richer information, including not only static objects but also actions and state changes useful for inducing verb phrases. We propose a Multi-Modal Compound PCFG model (MMC-PCFG) to effectively aggregate these rich features from different modalities.
  arXiv  Detail & Related papers  (2021-04-09T14:01:36Z)
• Segmenting Natural Language Sentences via Lexical Unit Analysis [47.273602658066196]
  We present Lexical Unit Analysis (LUA), a framework for general sequence segmentation tasks. LUA scores all the valid segmentation candidates and utilizes dynamic programming (DP) to extract the maximum scoring one. We have conducted extensive experiments on 5 tasks, including syntactic chunking, named entity recognition (NER), slot filling, Chinese word segmentation, and Chinese part-of-speech (POS) tagging, across 15 datasets.
  arXiv  Detail & Related papers  (2020-12-10T02:31:52Z)
• A Systematic Characterization of Sampling Algorithms for Open-ended Language Generation [71.31905141672529]
  We study the widely adopted ancestral sampling algorithms for auto-regressive language models. We identify three key properties that are shared among them: entropy reduction, order preservation, and slope preservation. We find that the set of sampling algorithms that satisfies these properties performs on par with the existing sampling algorithms.
  arXiv  Detail & Related papers  (2020-09-15T17:28:42Z)
• Strong Generalization and Efficiency in Neural Programs [69.18742158883869]
  We study the problem of learning efficient algorithms that strongly generalize in the framework of neural program induction. By carefully designing the input / output interfaces of the neural model and through imitation, we are able to learn models that produce correct results for arbitrary input sizes.
  arXiv  Detail & Related papers  (2020-07-07T17:03:02Z)
• Research on Annotation Rules and Recognition Algorithm Based on Phrase Window [4.334276223622026]
  We propose labeling rules based on phrase windows, and designed corresponding phrase recognition algorithms. The labeling rule uses phrases as the minimum unit, di-vides sentences into 7 types of nestable phrase types, and marks the grammatical dependencies between phrases. The corresponding algorithm, drawing on the idea of identifying the target area in the image field, can find the start and end positions of various phrases in the sentence.
  arXiv  Detail & Related papers  (2020-07-07T00:19:47Z)
• Vietnamese Word Segmentation with SVM: Ambiguity Reduction and Suffix Capture [2.7528170226206443]
  We propose two novel ways to feature extraction, one to reduce the overlap ambiguity and the other to increase the ability to predict unknown words containing suffixes. Our proposed method obtained a better F1-score than the prior state-of-the-art methods UETsegmenter, and RDRsegmenter.
  arXiv  Detail & Related papers  (2020-06-14T05:19:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.