String-tree correspondence grammar: a declarative grammar formalism for defining the correspondence between strings of terms and tree structures

Authors:
Yusoff Zaharin
Affiliations:
Université de Grenoble, Saint-Martin-D'Heres, France
Venue:
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Year:
1987

Citing 2
Cited 3

Syntactic and semantic parsability

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
SCSL: a linguistic specification language for MT

COLING '86 Proceedings of the 11th coference on Computational linguistics

On formalisms and analysis, generation and synthesis in machine translation

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Representation trees and string-tree correspondences

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Generation of synthesis programs in ROBRA (ARIANE) from string-tree correspondence grammars: or a strategy for synthesis in machine translation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces a grammar formalism for defining the set of sentences in a language, a set of labeled trees (not the derivation trees of the grammar) for the representation of the interpretation of the sentences, and the (possibly non-projective) correspondence between subtrees of each tree and substrings of the related sentence. The grammar formalism is motivated by the linguistic approach (adopted at GETA) where a multilevel interpretative structure is associated to a sentence. The topology of the multilevel structure is 'meaning' motivated, and hence its substructures may not correspond projectively to the substrings of the related sentence.