Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Satta, Giorgio Eisner, Jason |
| Abstract | Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n^4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n^5). For a common special case that was known to allow O(n³) parsing (Eisner, 1997), we present an O(n³) algorithm with an improved grammar constant. |
| File Format | |
| Publisher Date | 1999-01-01 |
| Publisher Institution | IN ACL 37 |
| Access Restriction | Open |
| Subject Keyword | Particular Head Word Head Automaton Grammar Parsing Algorithm Bilexical Context-free Grammar Bilexical Formalism Common Special Case Improved Grammar Constant Prior Upper Bound Word Type Bilexical Grammar Particular Complement Several Recent Stochastic Parser |
| Content Type | Text |
