Titlebook: Logical Aspects of Computational Linguistics; First International Christian Retoré Conference proceedings 1997 Springer-Verlag Berlin Heid

厚顏

獨(dú)輪車

吸引人的花招

遺傳

Semilinearity as a syntactic invariant,ull complexity of natural languages. We show that, in a formal sense, Old Georgian can be taken to provide an example of a non-semilinear language. This implies that none of the aforementioned grammar formalisms is strong enough to generate this language.

Deject

https://doi.org/10.1007/BFb0052147computational linguistics; formal proof; linguistics; logic; natural language; programming; semantics

叢林

978-3-540-63700-4Springer-Verlag Berlin Heidelberg 1997

古董

sparse

Constructing different phonological bracketings from a proof net,We state and prove Roorda‘s interpolation theorem in the framework of proof-net theory. This allows us to transform any proofnet into some other proof-net that matches some given (phonological or prosodic) bracketing.

exhibit

觀察