Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
In this paper, lmrsing-as-deduction and constraint programming are brought together to outline a procedure for the speeitication of constraint-based chart parsers. Fob lowing the ...
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
This paper presents a system which analyzes an in'put text syntactically and morphologically and converts the text from the graphemic to the phonetic :representation (or vice...
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...