MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars

Abstract

MICA is a dependency parser which returns deep dependency representations, is fast, has state-of-the-art performance, and is freely available.

Domains

Computation and Language [cs.CL]
Fichier principal
Vignette du fichier
NAACL09appnote.pdf (60.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Benoît Sagot  : Connect in order to contact the contributor

https://inria.hal.science/inria-00616695

Submitted on : Wednesday, August 24, 2011-12:10:32 AM

Last modification on : Friday, March 24, 2023-2:52:54 PM

Long-term archiving on: Monday, November 12, 2012-3:45:31 PM

Download

Dates and versions

inria-00616695 , version 1 (24-08-2011)

Identifiers

  • HAL Id : inria-00616695 , version 1

Cite

Srinivas Bangalore, Pierre Boullier, Alexis Nasr, Owen Rambow, Benoît Sagot. MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars. NAACL 2009 - North American Chapter of the Association for Computational Linguistics (Short Papers), 2009, Boulder, Colorado, United States. ⟨inria-00616695⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 LIF CNRS INRIA UNIV-AMU INRIA2 CAMPUS-AAR AAI LIS-LAB
112 View
150 Download

Share

Gmail Facebook X LinkedIn More