AbstractA robust parser for context-free grammars, based on a dynamic programming architecture, is described. We integrate a regional error repair algorithm and a strategy to deal with incomplete sentences including unknown parts of unknown length. Experimental tests prove the validity of the approach, illustrating the perspectives for its application in real systems over a variety of different situations, as well as the causes underlying the computational behavior observed
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
This paper presents a new parsing algorithm for unrestricted context-free grammars. Basically, it ma...
AbstractA robust parser for context-free grammars, based on a dynamic programming architecture, is d...
Abstract. We work in the domain of a regional least-cost strategy with dynamic validation in order t...
AbstractRobustness, the ability to analyze any input regardless of its grammaticality, is a desirabl...
Abstract—Parsing systems able to analyze natural language text robustly would be of great value in c...
We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown p...
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
The rule-based parsing is a prevalent method for the natural language understanding (NLU) and has be...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
A parsing system is a key element of many computer applications such as Information Retrieval, Knowl...
Parser generators are an indispensable tool for rapid language devel- opment. However, they often fa...
Program analysis tools used in software maintenance must be robust and ought to be accurate. Many da...
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
This paper presents a new parsing algorithm for unrestricted context-free grammars. Basically, it ma...
AbstractA robust parser for context-free grammars, based on a dynamic programming architecture, is d...
Abstract. We work in the domain of a regional least-cost strategy with dynamic validation in order t...
AbstractRobustness, the ability to analyze any input regardless of its grammaticality, is a desirabl...
Abstract—Parsing systems able to analyze natural language text robustly would be of great value in c...
We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown p...
In this paper we approach the following problem: Given an arbitrary language describing device (e.g....
The rule-based parsing is a prevalent method for the natural language understanding (NLU) and has be...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
A parsing system is a key element of many computer applications such as Information Retrieval, Knowl...
Parser generators are an indispensable tool for rapid language devel- opment. However, they often fa...
Program analysis tools used in software maintenance must be robust and ought to be accurate. Many da...
An efficient context-free parsing algorithm is presented that can parse sentences with unknown parts...
Parsing efficiency is crucial when building practical natural language systems. This paper introduce...
This paper presents a new parsing algorithm for unrestricted context-free grammars. Basically, it ma...
DOI
Add to ORKG