expression tree

(redirected from Parse tree)
Also found in: Wikipedia.

expression tree

(mathematics, grammar)
Mentioned in ?
References in periodicals archive ?
So you are creating a grammatical parse tree and one of the benefits of this is, rather than bag of words where you might have tens of thousands of features, you have a low dimensional feature representation when you create these grammatical parse trees.
u [member of] T* pictorially using a parse tree, which is defined in the same way as for context-free grammars (see for example Hopcroft and Ullman (1979) page 83) with root labeled by S, internal nodes labeled by [A.
We next transformed the parse tree into a Dependency Graph (DG) format (De Marneffe et al.
In next step, sentence is supplied to syntactic parser which produce possible parse tree from the sentence.
In NL to SBVR translation, we have used the Stanford parser to perform syntactic analysis by producing a parse tree and a set of (typed) dependencies.
A parse tree is built up from a 'terminal set' (the input variables in the problem and randomly generated constants, i.
This instrument represents the structure of every sentence with a parse tree, having words as nodes and logical links between them as edges (see Fig.
The framework generates more than one parse tree for each sentence using a probabilistic parser, and annotates each node of these parse trees with main-parts information which is set of key terms from the node's branch based on the linguistic structure of the branch.
An example of an Amazon parse tree for the cluster zou schijnen te hebben gebeld `would seem to have called' is shown in II.
This resulting parse tree is used by the interpreter to extract constraints.
Intuitively, only a bounded amount of information need be stored, whenever parsing decisions can be unambiguously made, looking at a subtree of the parse tree, whose size is bounded.