Frédéric Tendeau
Also published as: Frederic Tendeau
2000
ContextFree Grammar Rewriting and the Transfer of Packed Linguistic Representations
Marc Dymetman

Frederic Tendeau
COLING 2000 Volume 2: The 18th International Conference on Computational Linguistics
1997
An Earley Algorithm for Generic Attribute Augmented Grammars and Applications
Frederic Tendeau
Proceedings of the Fifth International Workshop on Parsing Technologies
We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CFgrammars decorated by attributes.
1995
Stochastic ParseTree Recognition by a Pushdown Automaton
Frédéric Tendeau
Proceedings of the Fourth International Workshop on Parsing Technologies
We present the stochastic generalization of what is usually called correctness theorems: we guarantee that the probabilities computed operationally by the parsing algorithms are the same as those defined denotationally on the trees and forests defined by the grammar. The main idea of the paper is to precisely relate the parsing strategy with a parsetree exploration strategy: a computational path of a parsing. algorithm simply performs an exploration of a parsetree for the input portion already parsed. This approach is applied in particular to Earley and LeftCorner parsing algorithms. Probability computations follow parsing operations: looping problems (in rule prediction and subtree recognition) are solved by introducing probability variables (which may not be immediately evaluated). Convergence is ensured by the syntactic construction that leads to stochastic equations systems, which are solved as soon as possible. Our algorithms accept any (probabilistic) CF grammar. No restrictions are made such as prescribing normal form, proscribing empty rules or cyclic grammars.
Search