Chart parser

Known as: Chart parsing 
In computer science, a chart parser is a type of parser suitable for ambiguous grammars (including grammars of natural languages). It uses the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1981-2017
05101519812017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We describe Joshua, an open source toolkit for statistical machine translation. Joshua implements all of the algorithms required… (More)
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present translation results on the shared task ”Exploiting Parallel Texts for Statistical Machine Translation” generated by a… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Multimodal interfaces require effective parsing and understanding of utterances whose content is distributed across multiple… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In order to realize their full potential, multimodal systems need to support not just input from multiple modes, but also… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Best-first parsing methods for natural language try to parse efficiently by considering the most likely constituents first. Some… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We describe work toward the construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on… (More)
  • figure 1
  • figure 2
  • figure 6
  • table 1
  • table 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This i)al)er describes a Ilatural language i)ars-ing algorith,n for unrestricted text which uses a prol)al)ility-I~ased scoring… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1988
1988
We describe a parallel implementation of a chart parser for a shared-memory multipro-cessor. The speed-ups obtained with this… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 4
Is this relevant?