Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Separating surface order and syntactic relations in a dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Pseudo-projectivity: a polynomially parsable non-projective dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Topological dependency trees: a constraint-based account of linear precedence
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Word order in German: a formal dependency grammar using a topological hierarchy
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generation as dependency parsing
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
On using a parallel graph rewriting formalism in generation
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Pseudo-projective dependency parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Polarized unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
This paper describes a minimal topology driven parsing algorithm for topological grammars that synchronizes a rewriting grammar and a dependency grammar, obtaining two linguistically motivated syntactic structures. The use of non-local slash and visitor features can be restricted to obtain a CKY type analysis in polynomial time. German long distance phenomena illustrate the algorithm, bringing to the fore the procedural needs of the analyses of syntax-topology mismatches in constraint based approaches like for example HPSG.