For example , Radzinsky ( 1991 ) proves that Chinese numerals such as wu zhao zhao zhao zhao zhao wu zhao zhao zhao zhao wu zhao zhao zhao wu zhao zhao wu zhao , for the number 5000000000000000005000000000000005000000000005000000005000 , are not context-free , which implies that Chinese is not a context-free language and thus might parse in exponential worst-case time .
chinese numbernames tree adjoining languages and mild contextsensitivity
Daniel Radzinsky
Average , since it can happen that the grammar does admit hard-toparse sentences that are not used ( or at least not frequently used ) in the real corpus . For example , Radzinsky ( 1991 ) proves that Chinese numerals such as wu zhao zhao zhao zhao zhao wu zhao zhao zhao zhao wu zhao zhao zhao wu zhao zhao wu zhao , for the number 5000000000000000005000000000000005000000000005000000005000 , are not context-free , which implies that Chinese is not a context-free language and thus might parse in exponential worst-case time . Do such arguments -- no doubt important for mathematical linguistics -- have any direct consequences for an engineering linguistics ?
For example , @@CITATION proves that Chinese numerals such as wu zhao zhao zhao zhao zhao wu zhao zhao zhao zhao wu zhao zhao zhao wu zhao zhao wu zhao , for the number 5000000000000000005000000000000005000000000005000000005000 , are not context-free , which implies that Chinese is not a context-free language and thus might parse in exponential worst-case time .