amads 1.2.0

A toolkit for symbolic music analysis

Algorithms for Music Analysis and Data Science (AMADS)

This repository represents the very earliest stages of an attempt to collect and organise algorithms for music analysis and data science. If you are interested in participating, please get in touch with Mark Gotham or Roger Dannenberg.

Much functionality in this package still remains to be tested/implemented/documented. Use at your own risk!

For more on the ...

• ... package in general, see the documentation website
• ... motivation and background, please see the draft paper

Installation

To use AMADS we recommend cloning the repository and installing it in editable mode. So:

cd ~/Documents  # or wherever you want to put the package
git clone https://github.com/music-computing/amads.git
pip install -e amads

Design principles

1. We opt to create one repository, in one langauge, rather than attempting to list / direct to others.
   • It makes sense to have a single reference language for interoperability, comparison and more.
   • The sources are far-flung, in many code languages, and not interoperable.
   • That said, we do use AMADS as a kind of meta-package to connect to external well maintained libraries (including those not in Python), reimplementaing funationality anew here only if there is no practical, existing source to connect to.
2. The language is Python, for all the usual reasons, chief among them being it popularity.
   • some designers of computer languages programming languages may find that a rather shallow reason,
   • but commitment to access and interoperability makes a language's existing popularity critically important.
   • e.g., we have in mind the student of music who gets that computing will open things up for them, but who also wants the time they invest in learning the ropes to be transferable in case they ever want or need to move away from music computing (imagine!).
3. Algorithms are:
   • linked to a credible publication or other demonstrable take-up by the community.
   • implemented here as exactly as reference to the source allows (usually from scratch), or with clear commentary on any changes
   • open-source, well documented, etc.

Uses

We welcome all and any use cases. Among them, those we have had in mind during the development include:

• researchers using existing algorithms "off the shelf" for specific tasks, including comparison with a new approach
• students learning a standard algorithm by implementing is from scratch and comparing the output with a reference implementation.
• those considering entry into the field to browse all this casually.

Contributions

... are welcome!

Please pitch in relevant material, making sure to include any relevant citation. Equally, please feel free to add issues (or write directly) to propose algorithms you'd like to see us implement and include here.