Search Descriptions

Main Topics

Search Publications


author

title

other

year

Binarizing Synchronous Grammars

Complex rules may be too specific to be generally useful and also increase the complexity of parsing. Hence, we may want tp binarize either the parse trees from which rules are extracted or the rules themselves.

Binarizing SCFG is the main subject of 10 publications.

Publications

Binarization may be driven by the source side grammar (Zhang et al., 2006; Wang et al., 2007) or the target side grammar (Huang, 2007). A k-arization method with linear time complexity is proposed by Zhang and Gildea (2007). Nesson et al. (2008) present a k-arization method for STAG grammars.

Benchmarks

Discussion

Related Topics

New Publications

  • Büchse et al. (2013)
  • Nederhof and Satta (2011)
  • Xiao et al. (2009)
  • DeNero et al. (2009)
  • Fang et al. (2011)

Actions

Download

Contribute