20.07.2013 Views

Notes on computational linguistics.pdf - UCLA Department of ...

Notes on computational linguistics.pdf - UCLA Department of ...

Notes on computational linguistics.pdf - UCLA Department of ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Stabler - Lx 185/209 2003<br />

5 Trees, and tree manipulati<strong>on</strong>: sec<strong>on</strong>d idea<br />

5.1 Nodes and leaves in tree structures<br />

(1) The previous secti<strong>on</strong> introduced a standard way <strong>of</strong> representing n<strong>on</strong>-empty ordered trees uses a two<br />

argument term Label/Subtrees. 19<br />

The argument Label is the label <strong>of</strong> the tree’s root node, and Subtrees is the sequence <strong>of</strong> that node’s<br />

subtrees.<br />

A tree c<strong>on</strong>sisting <strong>of</strong> a single node (necessarily a leaf node) has an empty sequence <strong>of</strong> subtrees.<br />

For example, the 3 node tree with root labeled a and leaves labeled b and c is represented by the term<br />

a/[b/[], c/[]]:<br />

b<br />

While this representati<strong>on</strong> is sufficient to represent arbitrary trees, it is useful extend it by treating<br />

ph<strong>on</strong>ological forms not as separate terminal nodes, but as a kind <strong>of</strong> annotati<strong>on</strong> or feature <strong>of</strong> their<br />

parent nodes. This distinguishes “empty nodes” from leaf nodes with ph<strong>on</strong>ological c<strong>on</strong>tent; <strong>on</strong>ly the<br />

latter possess (n<strong>on</strong>-null) ph<strong>on</strong>ological forms. Thus in the tree fragment depicted above, the ph<strong>on</strong>ological<br />

forms Mary and walks are to be interpreted not as a separate nodes, but rather as comp<strong>on</strong>ents <strong>of</strong> their<br />

parent DP and V nodes.<br />

(2) While this representati<strong>on</strong> is sufficient to represent arbitrary trees, it is useful extend it by treating<br />

ph<strong>on</strong>ological forms not as separate terminal nodes, but as a kind <strong>of</strong> annotati<strong>on</strong> or feature <strong>of</strong> their parent<br />

nodes. This distinguishes “empty nodes” from leaf nodes with ph<strong>on</strong>ological c<strong>on</strong>tent; <strong>on</strong>ly the latter<br />

possess (n<strong>on</strong>-null) ph<strong>on</strong>ological forms. Thus in the tree fragment depicted just below, the ph<strong>on</strong>ological<br />

forms Mary and walks are to be interpreted not as a separate nodes, but rather as comp<strong>on</strong>ents <strong>of</strong> their<br />

parent DP and V nodes.<br />

DP<br />

Mary<br />

VP<br />

a<br />

V<br />

walks<br />

There are a number <strong>of</strong> ways this treatment <strong>of</strong> ph<strong>on</strong>ological forms could be worked out. For example,<br />

the ph<strong>on</strong>ological annotati<strong>on</strong>s could be regarded as features and handled with the feature machinery,<br />

perhaps al<strong>on</strong>g the lines described in Pollard and Sag (1989, 1993). While this is arguably the formalizati<strong>on</strong><br />

most faithful to linguists’ c<strong>on</strong>cepti<strong>on</strong>s, we have chosen to represent trees c<strong>on</strong>sisting <strong>of</strong> a single<br />

19 This notati<strong>on</strong> is discussed more carefully in Stabler (1992, p65).<br />

62<br />

c<br />

V’<br />

VP<br />

V’<br />

V

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!