Most natural language parsers require their input to be grammatical. This significantly constrains the search space that they must explore during parsing. Parsers which attempt to recover from extragrammatical input contend with a search space that is potentially much larger, since they cannot necessarily prune branches when grammatical expectations are violated. In this paper we discuss the control structure of the experimental MULTIPAR parser, which directs its search by exploring potential parses in order of their degree of grammatical deviation/
We describe a new algorithm for table-driven parsing with context-free grammars designed to support ...
This article introduces the idea that information compression by multiple alignment, unification and...
We describe a parser for robust and flexible interpretation of user utterances in a multi-modal syst...
Most recent statistical parsers fall into one of two groups. The largest group consists of parsers w...
We provide two different methods for bounding search when parsing with freer word-order languages. B...
Trabajo presentado al 3rd International Workshop on the Emergence and Evolution of Linguistic Commun...
This paper investigates the extent to which existing structural commitments constrain the human pars...
Large practical NLP applications require robust analysis components that can effectively handle inpu...
A parser is an algorithm that computes a structure for an input string given a grammar. All parsers ...
Robust natural language interpretation requires strong semantic domain models, "fall-soft" recovery ...
Practical natural language interfaces must exhibit robust behaviour in the presence of extragrammati...
This paper describes Grammar Learning by Partition Search, a general method for automatically constr...
Practical natural language interfaces must exhibit robust behaviour in the presence of extragrammati...
Extensible Dependency Grammar (XDG; Duchier and Debusmann (2001)) is a recently developed dependency...
Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate...
We describe a new algorithm for table-driven parsing with context-free grammars designed to support ...
This article introduces the idea that information compression by multiple alignment, unification and...
We describe a parser for robust and flexible interpretation of user utterances in a multi-modal syst...
Most recent statistical parsers fall into one of two groups. The largest group consists of parsers w...
We provide two different methods for bounding search when parsing with freer word-order languages. B...
Trabajo presentado al 3rd International Workshop on the Emergence and Evolution of Linguistic Commun...
This paper investigates the extent to which existing structural commitments constrain the human pars...
Large practical NLP applications require robust analysis components that can effectively handle inpu...
A parser is an algorithm that computes a structure for an input string given a grammar. All parsers ...
Robust natural language interpretation requires strong semantic domain models, "fall-soft" recovery ...
Practical natural language interfaces must exhibit robust behaviour in the presence of extragrammati...
This paper describes Grammar Learning by Partition Search, a general method for automatically constr...
Practical natural language interfaces must exhibit robust behaviour in the presence of extragrammati...
Extensible Dependency Grammar (XDG; Duchier and Debusmann (2001)) is a recently developed dependency...
Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate...
We describe a new algorithm for table-driven parsing with context-free grammars designed to support ...
This article introduces the idea that information compression by multiple alignment, unification and...
We describe a parser for robust and flexible interpretation of user utterances in a multi-modal syst...