منابع مشابه
Learning serial constraint-based grammars
In this paper we describe a method for learning grammars in the general framework of Harmonic Serialism (see McCarthy this volume for references and an introduction). We have two main goals. The first is to address the hidden structure problem that serial derivations introduce. The second is to address the problem of learning variation, which has yet to be confronted in this framework (see also...
متن کاملLocal Grammars and Compound Verb Lemmatization in Serbo - Croatian
The increasing production of electronic (digital) texts (either on the Web or in other electronically available forms, such as digital libraries or archives) demands appropriate computer tools that can help human users in text manipulation and, additionally, in performing automatic processing of language resources. In the first place, a natural language processing (NLP) system needs to implemen...
متن کاملExtended Cross-Serial Dependencies in Tree Adjoining Grammars
The ability to represent cross-serial dependencies is one of the central features of Tree Adjoining Grammar (TAG). The class of dependency structures representable by lexicalized TAG derivations can be captured by two graph-theoretic properties: a bound on the gap degree of the structures, and a constraint called well-nestedness. In this paper, we compare formalisms from two strands of extensio...
متن کاملSerial Correlation Coefficient
In this paper, we investigate the relation between two variables where the one is measured with the ratio or interval scale and the other with the nominal. In this cases, we use from serial correlation coefficient. Computation of some serial coefficient such as biserial and point-biserial coefficient is carried out with some examples and R program.
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1972
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(72)90854-6