Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

NAACL
2007

favoriteEmaildiscussreport

81views Computational Linguistics» more NAACL 2007»

Worst-Case Synchronous Grammar Rules

13 years 6 months ago

Worst-Case Synchronous Grammar Rules

Download www.cs.rochester.edu

We relate the problem of ﬁnding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to use the theory of expander graphs to show that the complexity of SCFG parsing of an input sentence of length N is Ω(Ncn), for a grammar with maximum rule length n and some constant c. This improves on the previous best result of Ω(Nc √ n).

Daniel Gildea, Daniel Stefankovic

Real-time Traffic

Computational Linguistics | Markov Random Field | Maximum Rule Length | NAACL 2007 | Synchronous ContextFree Grammar |

claim paper

Related Content

» Factoring Synchronous Grammars by Sorting

» Issues Concerning Decoding with Synchronous Contextfree Grammar

» Extracting Synchronous Grammar Rules From WordLevel Alignments in Linear Time

» Asynchronous Binarization for Synchronous Grammars

» Machine Translation Based on ConstraintBased Synchronous Grammar

» Generalizing Local and NonLocal WordReordering Patterns for SyntaxBased Machine Translatio...

» Joint Parsing and Alignment with Weakly Synchronized Grammars

» Hierarchical Phrasebased Machine Translation with Wordbased Reordering Model

» KISS Stochastic Packet Inspection Classifier for UDP Traffic

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	NAACL
Authors	Daniel Gildea, Daniel Stefankovic

Comments (0)