A hybrid formalism to parse Sign Languages

2014-03-18 · Rémi Dubot, Christophe Collet

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.

📄 PDF Abstract BibTeX arXiv:1403.4467

Code (0)

등록된 구현이 없습니다.

A new TAG Formalism for Tamil and Parser Analytics

2016-04-05 · Vijay Krishna Menon, S. Rajendran, M. Anand Kumar, K. P. Soman

Tree adjoining grammar (TAG) is specifically suited for morph rich and agglutinated languages like Tamil due to its psycho linguistic features and parse time dependency and morph resolution. Though TAG and LTAG formalism…

MORPH TAG

Advances in Using Grammars with Latent Annotations for Discontinuous Parsing

2020-07-01 · WS 2020 7 · Kilian Gebhardt

We present new experiments that transfer techniques from Probabilistic Context-free Grammars with Latent Annotations (PCFG-LA) to two grammar formalisms for discontinuous parsing: linear context-free rewriting systems an…

Combining Language Resources Into A Grammar-Driven Swedish Parser

2012-05-01 · LREC 2012 5 · Malin Ahlberg, Ramona Enache

This paper describes work on a rule-based, open-source parser for Swedish. The central component is a wide-coverage grammar implemented in the GF formalism (Grammatical Framework), a dependently typed grammar formalism b…

A rule-based system for cross-lingual parsing of Romance languages with Universal Dependencies

2017-08-01 · CONLL 2017 8 · Marcos Garcia, Pablo Gamallo

This article describes MetaRomance, a rule-based cross-lingual parser for Romance languages submitted to CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. The system is an almost delex…

Dependency Parsing POS TAG

Proof-theoretic aspects of NL$λ$

2020-10-23 · Richard Moot

We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calcul…