Browse over 20 million
homework answers & study documents

week4 discussion quesation no.2

Type

Homework

Rating

Showing Page:
1/2
Q Trees occur in various venues in computer science: decision trees in algorithms,
search trees, and so on. In linguiscs, one encounters trees as well, typically as parse
trees, which are essenally sentence diagrams, such as those you might have had to
do in primary school, breaking a natural-language sentence into its components—
clauses, subclauses, nouns, verbs, adverbs, adjecves, preposions, and so on. What
might be the signi"cance of the depth and breadth of a parse tree relave to the
sentence it represents? If you need to, look up parse tree and natural language
processing on the Internet to see some examples.
A strong grammar tree or parse tree is a tree that speaks to the syntactic structure of a string as
indicated by some formal syntax. In a parse tree, the inside hubs are marked by non-terminals of
the language structure, while the leaf hubs are named by terminals of the punctuation. Parse trees
may be produced for sentences in regular dialects and also throughout handling of codings, for
example, programming dialects. Parse trees are unique from conceptual punctuation trees in that
their structure and components all the more solidly reflect the linguistic use of the data dialect.
A parse tree is made up of nodes and branches. The image below represents a linguistic parse
tree, here representing the English sentence "John hit the ball".
For example
S for sentence, the top-level structure in this example
NP for noun phrase. The first (leftmost) NP, a single noun "John", serves as the subject of
the sentence. The second one is the object of the sentence.
VP for verb phrase, which serves as the predicate
V for verb. In this case, it's a transitive verb "hit".
Det for determiner, in this instance the definite article "the"
N for noun
In a parse tree, each node is either a root node, a branch node, or a leaf node. In the example to
the right, S is a root node, NP and VP are branch nodes, while John, hit, the, and ball are all leaf
nodes. A node can also be referred to as parent node or a child node. A parent node is one that
has at least one other node linked by a branch under it. In the example, S is a parent of both NP
and VP.

Sign up to view the full document!

lock_open Sign Up
https://www.princeton.edu/~achaney/tmve/wiki100k/docs/Parse_tree.html

Sign up to view the full document!

lock_open Sign Up

Anonymous
Really great stuff, couldn't ask for more. The assignment was done with remarkable detail.

Anonymous
Solid work, thanks.

Anonymous
Goes above and beyond expectations !

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4