Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars (1999)
Cached
Download Links
- [acl.ldc.upenn.edu]
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- [www.cs.jhu.edu]
- [cs.jhu.edu]
- DBLP
Other Repositories/Bibliography
by
Jason Eisner
,
Giorgio Satta
| Venue: | IN ACL 37 |
| Citations: | 74 - 15 self |
BibTeX
@INPROCEEDINGS{Eisner99efficientparsing,
author = {Jason Eisner and Giorgio Satta},
title = {Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars},
booktitle = {IN ACL 37},
year = {1999},
pages = {457--464},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
