Supplementary materials for "Leveraging graph algorithms to speed up the annotation of large rhymed corpora" by Julien Baley, published in CLAO 51.1 (2022)

These are the supplementary materials for an article published in Cahiers de Linguistique Asie Orientale (CLAO) entitled 'Leveraging graph algorithms to speed up the annotation of large rhymed corpora', by Julien Baley, with DOI: 10.1163/19606028-bja10019. Rhyming patterns play a crucial role in the phonological reconstruction of earlier stages of Chinese. The past few years have seen the emergence of the use of graphs to model rhyming patterns, notably with List’s (2016) proposal to use graph community detection as a way to go beyond the limits of the link-and-bind method and test new hypotheses regarding phonological reconstruction. List’s approach requires the existence of a rhyme-annotated corpus; such corpora are rare and prohibitively expensive to produce. The present paper solves this problem by introducing several strategies to automate annotation. Among others, the main contribution is the use of graph community detection itself to build an automatic annotator. This annotator requires no previous annotation, no knowledge of phonology, and automatically adapts to corpora of different periods by learning their rhyme categories. Through a series of case stud- ies, we demonstrate the viability of the approach in quickly annotating hundreds of thousands of poems with high accuracy.