메뉴 건너뛰기




Volumn 293, Issue 2, 2003, Pages 345-363

Structural similarity within and among languages

Author keywords

Grammar; Invariant; Linguistic universals

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; SET THEORY;

EID: 0037421570     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00351-6     Document Type: Conference Paper
Times cited : (48)

References (27)
  • 1
    • 0003408807 scopus 로고    scopus 로고
    • Proposal for a natural language processing syntactic backbone
    • Projet Atoll, INRIA, Rocquencourt
    • P. Boullier, Proposal for a natural language processing syntactic backbone, Tech. Rep. 3242, Projet Atoll, INRIA, Rocquencourt, 1998.
    • (1998) Tech. Rep. , vol.3242
    • Boullier, P.1
  • 5
    • 0012643169 scopus 로고    scopus 로고
    • Modification in the nominal expression
    • Norwegian University of Science and Technology, Trondheim
    • M. Dimitrova-Vulchanova, Modification in the nominal expression, in: Syntax and Semantics, Fall School, Norwegian University of Science and Technology, Trondheim, 1999.
    • (1999) Syntax and Semantics, Fall School
    • Dimitrova-Vulchanova, M.1
  • 6
    • 0346833408 scopus 로고    scopus 로고
    • A type logical perspective on minimalist derivations
    • Aix-en-Provence
    • T.L. Cornell, A type logical perspective on minimalist derivations, in: Proc. Formal Grammar'97, Aix-en-Provence, 1997.
    • (1997) Proc. Formal Grammar'97
    • Cornell, T.L.1
  • 7
    • 0001852664 scopus 로고
    • Some universals of grammar with particular reference to the order of meaningful elements
    • J. Greenberg. Stanford: Stanford University Press
    • Greenberg J. Some universals of grammar with particular reference to the order of meaningful elements. Greenberg J. Universals of Human Language. 1978;Stanford University Press, Stanford.
    • (1978) Universals of Human Language
    • Greenberg, J.1
  • 15
    • 0012746517 scopus 로고    scopus 로고
    • Transforming linear context free rewriting systems into minimalist grammars
    • Port-aux-Rocs, Le Croisic, France
    • J. Michaelis, Transforming linear context free rewriting systems into minimalist grammars, in: Proc. Logical Aspects of Computational Linguistics, LACL'01, Port-aux-Rocs, Le Croisic, France, 2001.
    • (2001) Proc. Logical Aspects of Computational Linguistics, LACL'01
    • Michaelis, J.1
  • 17
    • 43149125101 scopus 로고    scopus 로고
    • Chart parsing and constraint programming
    • F. Morawietz, Chart parsing and constraint programming, in: Proc. COLING-2000, 2000.
    • (2000) Proc. COLING-2000
    • Morawietz, F.1
  • 18
    • 0012747085 scopus 로고    scopus 로고
    • X(p)-movement and word order typology: 'Direct' versus 'inverse' languages
    • M. Pearson, X(p)-movement and word order typology: 'direct' versus 'inverse' languages, in: Abstracts of GLOW '99, 1999.
    • (1999) Abstracts of GLOW '99
    • Pearson, M.1
  • 21
    • 33750049678 scopus 로고    scopus 로고
    • Malagasy adverbs
    • Ileana Paul (Ed.) UCLA Occasional Papers in Linguistics 20, UCLA
    • A. Rackowski, Malagasy adverbs, in: Ileana Paul (Ed.), The Structure of Malagasy, Vol. II. UCLA Occasional Papers in Linguistics 20, UCLA, 1998.
    • (1998) The Structure of Malagasy , vol.2
    • Rackowski, A.1
  • 22
    • 0012702582 scopus 로고    scopus 로고
    • The principle of minimal compliance
    • Richards N. The principle of minimal compliance. Linguist. Inquiry. 29:1998;599-629.
    • (1998) Linguist. Inquiry , vol.29 , pp. 599-629
    • Richards, N.1
  • 26
    • 0012730427 scopus 로고    scopus 로고
    • Remnant movement and complexity
    • G. Bouma, E. Hinrichs, G.-J. Kruijff, & D. Oehrle. CA: CSLI, Stanford
    • Stabler E.P. Remnant movement and complexity. Bouma G., Hinrichs E., Kruijff G.-J., Oehrle D. Constraints and Resources in Natural Language Syntax and Semantics. 1999;299-326 CSLI, Stanford, CA.
    • (1999) Constraints and Resources in Natural Language Syntax and Semantics , pp. 299-326
    • Stabler, E.P.1
  • 27
    • 0001530190 scopus 로고
    • The equivalence of four extensions of context free grammar formalisms
    • Vijay-Shanker K., Weir D. The equivalence of four extensions of context free grammar formalisms. Math. Systems Theory. 27:1994;511-545.
    • (1994) Math. Systems Theory , vol.27 , pp. 511-545
    • Vijay-Shanker, K.1    Weir, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.