This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) per edge. It has applications to unification-based grammars with very large partially ordered categories, in which copying is expensive, and can facilitate the use of more sophisticated indexing strategies for retrieving such categories that may otherwise be overwhelmed by the cost of such copying. It als
AbstractAn implementation of PROLOG based on general clause-indexing methods using bit-serial conten...
Abstract: We give a new treatment of tabular LR parsing, which is an alternative to Tomita's general...
In this paper, we present an efficient algorithm for parsing natural language using unification gram...
This paper presents a new parsing algorithm that reduces the amount of copying required in a memois...
Several differing approaches to parsing using Prolog are discussed and their characteristics outline...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
© Springer-Verlag Berlin Heidelberg 1998. The SLG-WAM implements tabling by freezing the WAM stacks:...
The efficiency problem in parsing with large-scale unification grammars, including implementations i...
We develop an improved form of left-corner chart parsing for large context-free grammars, introducin...
The analysis of programming languages is a fundamental activity in the process of comprehending, mai...
The design and implementation of an incremental copying heap garbage collector for WAM-based Prolog ...
This paper presents the reasoning behind the selection and design of a parser for the Lingo project ...
The logic programming language Prolog uses a resource-efficient SLD resolution strategy for query an...
The logic programming language Prolog uses a resource-efficient SLD resolution strategy for query an...
AbstractIndexing Prolog clauses is an important optimization step that reduces the number of clauses...
AbstractAn implementation of PROLOG based on general clause-indexing methods using bit-serial conten...
Abstract: We give a new treatment of tabular LR parsing, which is an alternative to Tomita's general...
In this paper, we present an efficient algorithm for parsing natural language using unification gram...
This paper presents a new parsing algorithm that reduces the amount of copying required in a memois...
Several differing approaches to parsing using Prolog are discussed and their characteristics outline...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
© Springer-Verlag Berlin Heidelberg 1998. The SLG-WAM implements tabling by freezing the WAM stacks:...
The efficiency problem in parsing with large-scale unification grammars, including implementations i...
We develop an improved form of left-corner chart parsing for large context-free grammars, introducin...
The analysis of programming languages is a fundamental activity in the process of comprehending, mai...
The design and implementation of an incremental copying heap garbage collector for WAM-based Prolog ...
This paper presents the reasoning behind the selection and design of a parser for the Lingo project ...
The logic programming language Prolog uses a resource-efficient SLD resolution strategy for query an...
The logic programming language Prolog uses a resource-efficient SLD resolution strategy for query an...
AbstractIndexing Prolog clauses is an important optimization step that reduces the number of clauses...
AbstractAn implementation of PROLOG based on general clause-indexing methods using bit-serial conten...
Abstract: We give a new treatment of tabular LR parsing, which is an alternative to Tomita's general...
In this paper, we present an efficient algorithm for parsing natural language using unification gram...