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 publication. 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
While natural language is usually analyzed from left to right, bidirectional parsing is very attract...
This paper introduces algorithms for non-projective parsing based on dual decomposition. We focus on...
AbstractWe present a new variant of the Earley parsing algorithm capable of efficiently supporting c...
Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It pa...
Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It pa...
We study the problem of finding the best headdriven parsing strategy for Linear Context- Free Rewrit...
We study the problem of finding the best head-driven parsing strategy for Linear Context-Free Rewrit...
This paper describes an efficient and robust implementation of a bidirectional, head-driven parser f...
In this lecture we discuss a second parsing algorithm that traverses the input string from left to r...
Abstract. We discuss a generalization of Earley’s algorithm to gram-mars licensing discontinuous con...
An adaptation of the standard LR(1) and LALR(1) parsing algorithm is described such that a top-down ...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
In this paper, we propose a right-to-left dependency grammar parsing method for languages in which a...
This report describes a new algorithm for table-driven parsing with arbitrary context-free grammars....
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
While natural language is usually analyzed from left to right, bidirectional parsing is very attract...
This paper introduces algorithms for non-projective parsing based on dual decomposition. We focus on...
AbstractWe present a new variant of the Earley parsing algorithm capable of efficiently supporting c...
Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It pa...
Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It pa...
We study the problem of finding the best headdriven parsing strategy for Linear Context- Free Rewrit...
We study the problem of finding the best head-driven parsing strategy for Linear Context-Free Rewrit...
This paper describes an efficient and robust implementation of a bidirectional, head-driven parser f...
In this lecture we discuss a second parsing algorithm that traverses the input string from left to r...
Abstract. We discuss a generalization of Earley’s algorithm to gram-mars licensing discontinuous con...
An adaptation of the standard LR(1) and LALR(1) parsing algorithm is described such that a top-down ...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
In this paper, we propose a right-to-left dependency grammar parsing method for languages in which a...
This report describes a new algorithm for table-driven parsing with arbitrary context-free grammars....
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
While natural language is usually analyzed from left to right, bidirectional parsing is very attract...
This paper introduces algorithms for non-projective parsing based on dual decomposition. We focus on...
AbstractWe present a new variant of the Earley parsing algorithm capable of efficiently supporting c...