2D Trie for Fast Parsing

No abstract is available for this paper.

• Publication year

  2010

• Venue

  International Conference on Computational Linguistics

• Publication date

  2010-08-23

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Non-Projective Dependency Parsing in Expected Linear Time

  2009cited by this paper
• Efficient Parsing of Syntactic and Semantic Dependency Structures

  2009cited by this paper
• Concise Integer Linear Programming Formulations for Dependency Parsing

  2009cited by this paper
• The CoNLL-2009 Shared Task: Syntactic and Semantic Dependencies in Multiple Languages

  2009cited by this paper
• Quadratic-Time Dependency Parsing for Machine Translation

  2009cited by this paper
• A Second-Order Joint Eisner Model for Syntactic and Semantic Dependency Parsing

  2009cited by this paper
• Adding semantic roles to the Chinese Treebank

  2009cited by this paper
• splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications

  2008cited by this paper
• A New Perceptron Algorithm for Sequence Labeling with Non-Local Features

  2007cited by this paper
• Online Large-Margin Training of Dependency Parsers

  2005cited by this paper
• An Efficient Algorithm for Projective Dependency Parsing

  2003cited by this paper
• Online Passive-Aggressive Algorithms

  2003cited by this paper
• Shallow Parsing with Conditional Random Fields

  2003cited by this paper
• An efficient digital search algorithm by using a double-array structure

  1988cited by this paper

• Research on Methods of Microblogging Sentiment Feature Extraction Based on Dependency Parsing

  2015cites this paper
• Chinese Common Noun Phrase Resolution: An Unsupervised Probabilistic Model Rivaling Supervised Resolvers

  2015cites this paper
• Chinese Zero Pronoun Resolution: An Unsupervised Probabilistic Model Rivaling Supervised Resolvers

  2014cites this paper
• Chinese-English mixed text normalization

  2014cites this paper
• Fouille de règles d’annotation pour la reconnaissance d’entités nommées [Annotation rule mining for named entity recognition]

  2013cites this paper
• d'annotation comme instructions de structuration locale

  2013cites this paper
• Reconnaissance des entités nommées par exploration de règles d'annotation - Interpréter les marqueurs d'annotation comme instructions de structuration locale. (Named Entity Recognition by Mining Association Rules)

  2012cites this paper