## An Extended Theory Of Head-Driven Parsing (1994)

### Cached

### Download Links

- [acl.ldc.upenn.edu]
- [ucrel.lancs.ac.uk]
- [aclweb.org]
- [wing.comp.nus.edu.sg]
- [www.aclweb.org]
- [aclweb.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Mexico State University |

Citations: | 10 - 7 self |

### BibTeX

@INPROCEEDINGS{Nederhof94anextended,

author = {Mark-jan Nederhof},

title = {An Extended Theory Of Head-Driven Parsing},

booktitle = {Mexico State University},

year = {1994},

pages = {210--217}

}

### OpenURL

### Abstract

We show that more head-driven parsing algorithms can be formulated than those occurring in the existing literature. These algorithms are inspired by a family of left-to-right parsing algorithms from a recent publica- tion. We further introduce a more advanced notion of "head-driven parsing" which allows more detailed specification of the processing order of non-head elements in the right-hand side. We develop a parsing algorithm for this strategy, based on LR parsing techniques.

### Citations

452 |
Generalized Phrase Structure Grammar
- Gazdar
- 1985
(Show Context)
Citation Context ...eoretic point of view. This results in the weakening of the left-to-right feature of most traditional parsing methods. Following a pervasive trend in modern theories of Grammar (consider for instance =-=[5, 3, 11]-=-) the computational linguistics community has paid large attention to the head-driven paradigm by investigating its applications to context-free language parsing. Several methods have been proposed so... |

211 |
X-Bar Syntax: A Study of Phrase Structure
- Jackendoff
- 1977
(Show Context)
Citation Context ...eoretic point of view. This results in the weakening of the left-to-right feature of most traditional parsing methods. Following a pervasive trend in modern theories of Grammar (consider for instance =-=[5, 3, 11]-=-) the computational linguistics community has paid large attention to the head-driven paradigm by investigating its applications to context-free language parsing. Several methods have been proposed so... |

170 |
Information-Based Syntax and Semantics Volume 1 Fundamentals
- Pollard, Sag
- 1987
(Show Context)
Citation Context ...eoretic point of view. This results in the weakening of the left-to-right feature of most traditional parsing methods. Following a pervasive trend in modern theories of Grammar (consider for instance =-=[5, 3, 11]-=-) the computational linguistics community has paid large attention to the head-driven paradigm by investigating its applications to context-free language parsing. Several methods have been proposed so... |

22 | How to cover a grammar
- Leermakers
- 1989
(Show Context)
Citation Context ... succeeds in simultaneously processing all common infixes, irrespective of whether the left-hand sides of the corresponding rules are the same. This algorithm is inspired by exlended LR (ELR) parsing =-=[12, 7]-=- for extended context-free grammars (where right-hand sides consist of regular expressions over V). By analogy, it will be called extended HI (EHI) parsing. This algorithm uses yet another kind of ite... |

17 | Head-driven parsing for lexicalist grammars: Experimental results - Bouma, Noord - 1993 |

17 | An optimal tabular parsing algorithm
- Nederhof
- 1994
(Show Context)
Citation Context .../A, 35131 Padova Italy satt a@dei, unipd, it 210 the degree of nondeterminism of the resulting methods. These solutions range from predictive LR parsing to LR parsing [15, 1]. On the basis of work in =-=[8]-=- for nondeterministic left-to-right parsing, we trace here a theory of head-driven parsing going from crude top-down and head-corner to more sophisticated solutions, in the attempt to successively mak... |

16 | Increasing the applicability of lr parsing - Nederhof, Sarbo - 1993 |

10 |
Parsing extended LR(k) grammars
- Brown
- 1981
(Show Context)
Citation Context ... succeeds in simultaneously processing all common infixes, irrespective of whether the left-hand sides of the corresponding rules are the same. This algorithm is inspired by exlended LR (ELR) parsing =-=[12, 7]-=- for extended context-free grammars (where right-hand sides consist of regular expressions over V). By analogy, it will be called extended HI (EHI) parsing. This algorithm uses yet another kind of ite... |

10 |
Head-driven bidirectional parsing. A tabular method
- Satta, Stock
- 1989
(Show Context)
Citation Context ... its applications to context-free language parsing. Several methods have been proposed so far exploiting some nondeterministic head-driven strategy for context-free language parsing (see among others =-=[6, 13, 2, 14]-=-). All these proposals can be seen as generalizations to the head-driven case of parsing prescriptions originally conceived for the left-to-right case. The methods above suffer from deficiencies that ... |

7 |
A method for transforming grammars into LL(k) form
- Soisalon-Soininen, Ukkonen
- 1979
(Show Context)
Citation Context ...ica e Informatica via Gradenigo 6/A, 35131 Padova Italy satt a@dei, unipd, it 210 the degree of nondeterminism of the resulting methods. These solutions range from predictive LR parsing to LR parsing =-=[15, 1]-=-. On the basis of work in [8] for nondeterministic left-to-right parsing, we trace here a theory of head-driven parsing going from crude top-down and head-corner to more sophisticated solutions, in th... |

6 |
Parsing 2-Dimensional Language
- Tomita
- 1989
(Show Context)
Citation Context ...mars can be effectively handled with a generalization of HI parsing (generalized HI (GHI) parsing). This new algorithm exhibits a superficial similarity to the 2-dimensional LR parsing algorithm from =-=[16]-=-. For a set Q of trees and rules, 4 closure(Q) is defined to be 4It is interesting to compare the relation between trees and rules with the one between kernel and nonkernel items of LR parsing [1]. 21... |

4 |
op den Akker, R.: Predictive Head-Corner Chart Parsing
- Sikkel
- 1996
(Show Context)
Citation Context ... its applications to context-free language parsing. Several methods have been proposed so far exploiting some nondeterministic head-driven strategy for context-free language parsing (see among others =-=[6, 13, 2, 14]-=-). All these proposals can be seen as generalizations to the head-driven case of parsing prescriptions originally conceived for the left-to-right case. The methods above suffer from deficiencies that ... |

2 |
Noord. Reversibility in Natural Language Processing
- van
- 1993
(Show Context)
Citation Context ...th context-free parsing (eft the standard evaluation of definite clause grammars), which may lead to more efficient processing. This holds for left-to-right parsing as well as for head-driven parsing =-=[10]-=-. Head-corner parsing The predictive steps from Algorithm 1, represented by Clause 0 and supported by Clauses 0a and 0b, can be compiled into the head-corner relation ~)*. This gives the head-corner (... |

1 |
I/ead-driven parsing
- Kay
- 1989
(Show Context)
Citation Context ... its applications to context-free language parsing. Several methods have been proposed so far exploiting some nondeterministic head-driven strategy for context-free language parsing (see among others =-=[6, 13, 2, 14]-=-). All these proposals can be seen as generalizations to the head-driven case of parsing prescriptions originally conceived for the left-to-right case. The methods above suffer from deficiencies that ... |