Parsing TAG with Abstract Categorial Grammar.
hal.structure.identifier | Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES] | |
dc.contributor.author | SALVATI, Sylvain | |
dc.date.accessioned | 2024-04-15T09:54:07Z | |
dc.date.available | 2024-04-15T09:54:07Z | |
dc.date.issued | 2006 | |
dc.date.conference | 2006 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198646 | |
dc.description.abstractEn | This paper presents informally an Earley algorithm for TAG which behaves as the algorithm given by [SJ88]. This algorithm is a specialization to TAG of a more general algorithm dedicated to second order ACGs. As second order ACGs allows to encode Linear Context Free Rewriting Systems (LCFRS) [dGP04], the main purpose of this paper is to give a rough presentation of formal tools which can be used to design efficient algorithms for LCFRS. | |
dc.language.iso | en | |
dc.title.en | Parsing TAG with Abstract Categorial Grammar. | |
dc.type | Communication dans un congrès | |
dc.subject.hal | Informatique [cs]/Informatique et langage [cs.CL] | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms | |
bordeaux.country | AU | |
bordeaux.conference.city | Sidney | |
bordeaux.peerReviewed | oui | |
hal.identifier | inria-00334009 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | non | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//inria-00334009v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2006&rft.au=SALVATI,%20Sylvain&rft.genre=unknown |
Fichier(s) constituant ce document
Fichiers | Taille | Format | Vue |
---|---|---|---|
Il n'y a pas de fichiers associés à ce document. |