A hybrid formalism to parse sign languages

• Main Authors: Dubot, Rémi, Collet, Christophe
• Other Authors: Traitement et Compréhension d’Images (IRIT-TCI), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse III - Paul Sabatier (UT3)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2014
• Subjects: Sign Languages; Hybrid formalism; [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]; [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing; [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]; [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]; [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]; Iceland
• Online Access: https://hal.archives-ouvertes.fr/hal-01137244; https://hal.archives-ouvertes.fr/hal-01137244/document; https://hal.archives-ouvertes.fr/hal-01137244/file/Dubot_13112.pdf

International audience Sign Language (SL) linguistic is dependent on the expensive task of annotating. Some automation is already available for low-level information (eg. body part tracking) and the lexical level has shown significant progresses. The syntactic level lacks annotated corpora as well as complete and consistent models. This article presents a solution for the automatic annotation of SL syntactic elements. It exposes a formalism able to represent both constituency-based and dependency-based models. The first enable the representation the structures one may want to annotate, the second aims at fulfilling the holes of the first. A parser is presented and used to conduct two experiments on the solution. One experiment is on a real corpus, the other is on a synthetic corpus.