The author discusses a method to name a chord based on the notes played. By assigning one note as the root, the algorithm calculates intervals and matches them to chord names in a database, considering accidental notes. The algorithm prioritizes names with fewer accidentals for a more accurate representation of the chord. Using a unique sorting mechanism, chords are structured in a way that chords with the same number of accidentals can be stored in a multiset. This ensures all possible chord names are considered, offering a comprehensive solution for chord naming based on input notes.
https://blog.s20n.dev/posts/how-chordcat-works/