Author of the publication

MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars (Application Note).

, , , , and . HLT-NAACL (Short Papers), page 185-188. The Association for Computational Linguistics, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

S XPipe 2: an architecture for surface preprocessing of raw corpora., and . Trait. Autom. des Langues, 49 (2): 155-188 (2008)Constructing parse forests that include exactly the n-best PCFG trees., , and . IWPT, page 117-128. The Association for Computational Linguistics, (2009)Guided Earley Parsing.. IWPT, page 43-54. (2003)A generalization of mildly context-sensitive formalisms.. TAG+, page 17-20. Institute for Research in Cognitive Science, (1998)Counting with range concatenation grammars.. Theor. Comput. Sci., 293 (2): 391-416 (2003)Les Grammaires à Concaténation d'Intervalles (RCG) comme formalisme grammatical pour la linguistique., and . TALN (Articles longs), page 349-358. ATALA, (2004)Parsing Directed Acyclic Graphs with Range Concatenation Grammars., and . IWPT, page 254-265. The Association for Computational Linguistics, (2009)Are Very Large Context-Free Grammars Tractable?, and . IWPT, page 94-105. Association for Computational Linguistics, (2007)Yet Another $0(n^6)$ Recognition Algorithm for Mildly Context-Sensitive Languages.. IWPT, page 34-47. Association for Computational Linguistics, (1995)Range Concatenation Grammars.. IWPT, page 53-64. (2000)