An Efficient Lightweight Algorithm for Automatic Meters Identification and Error Management in Arabic Poetry

This paper targets the problem of automatic meter identification and error management in Arabic poetry. Many approaches use high level abstractions of poems in their prosodic forms: feet patterns, cords and pegs forms, or syllables. Our algorithm manipulates directely binary representations of meters and prosodic forms of verses, with computing distances between those representations. Our algorithm does not need to handle explicitely neither the foot patterns relaxations nor defects which makes our algorithm compared to studied works simpler (i.e. no symbolic combinatory analysis rules for exception patterns), and efficient in time and memory with dynamic programming of Levenshtein distance.