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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Stabler - Lx 185/209 2003<br />

(46) Does any c<strong>on</strong>structi<strong>on</strong> similar to a n b n c n occur in any natural language? There are arguments that<br />

English is not c<strong>on</strong>text free, but the best known arguments c<strong>on</strong>sider parts <strong>of</strong> English which are similar<br />

to a i b j a i b j or the language<br />

{xx| x any n<strong>on</strong>empty str ing <strong>of</strong> ter minal symbols}<br />

These languages are not c<strong>on</strong>text-free. Purported examples <strong>of</strong> this kind <strong>of</strong> thing occur in ph<strong>on</strong>ological/morphological<br />

reduplicati<strong>on</strong>, in simplistic treatments <strong>of</strong> the “respectively” c<strong>on</strong>structi<strong>on</strong> in English;<br />

in some c<strong>on</strong>structi<strong>on</strong>s in a Swiss-German dialect. Some classic discussi<strong>on</strong>s <strong>of</strong> these issues are reprinted<br />

in Savitch et al. (1987).<br />

(47) Tree grammars and automata that accept trees have been studied extensively (Gecseg and Steinby, 1984),<br />

particularly because they allow elegant logical (in fact, model-theoretic) characterizati<strong>on</strong>s (Cornell and<br />

Rogers, 1999). Tree automata have also been used in the analysis <strong>of</strong> n<strong>on</strong>-CFLs (Mönnich, 1997; Michaelis,<br />

Mönnich, and Morawietz, 2000; Rogers, 2000).<br />

54

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

Saved successfully!

Ooh no, something went wrong!