메뉴 건너뛰기




Volumn 120, Issue 5, 2010, Pages 1194-1208

The VC dimension of constraint-based grammars

Author keywords

Complexity; Harmonic Grammar; Learnability; Optimality Theory; VC dimension

Indexed keywords


EID: 77949875170     PISSN: 00243841     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.lingua.2009.07.001     Document Type: Article
Times cited : (6)

References (48)
  • 5
    • 0038384383 scopus 로고    scopus 로고
    • On-line algorithms in machine learning
    • Fiat A., and Woeginger G. (Eds), Springer, Berlin
    • Blum A. On-line algorithms in machine learning. In: Fiat A., and Woeginger G. (Eds). Online Algorithms: The State of the Art (1998), Springer, Berlin
    • (1998) Online Algorithms: The State of the Art
    • Blum, A.1
  • 6
    • 0024750852 scopus 로고
    • Learnability and the Vapnik-Chervonenkis dimension
    • Blumer A., Ehrenfeucht A., Haussler D., and Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36 4 (1989) 929-965
    • (1989) J. ACM , vol.36 , Issue.4 , pp. 929-965
    • Blumer, A.1    Ehrenfeucht, A.2    Haussler, D.3    Warmuth, M.K.4
  • 7
    • 70350397903 scopus 로고    scopus 로고
    • Ms, University of Amsterdam and University of Massachusetts at Amherst ROA-970 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • Boersma P., and Pater J. Convergence Properties of a Gradual Learning Algorithm for Harmonic Grammar (2008), Ms, University of Amsterdam and University of Massachusetts at Amherst. http://roa.rutgers.edu ROA-970 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • (2008) Convergence Properties of a Gradual Learning Algorithm for Harmonic Grammar
    • Boersma, P.1    Pater, J.2
  • 9
    • 27144489164 scopus 로고    scopus 로고
    • A tutorial on support vector machines for pattern recognition
    • Burges C. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2 2 (1998) 121-167
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.2 , pp. 121-167
    • Burges, C.1
  • 12
    • 84891678008 scopus 로고    scopus 로고
    • Cumulative faithfulness effects: opaque or transparent?
    • Farris-Trimble A., and Dinnsen D. (Eds), IULC Publications, Bloomington, Indiana
    • Farris-Trimble A. Cumulative faithfulness effects: opaque or transparent?. In: Farris-Trimble A., and Dinnsen D. (Eds). IUWPL6: Phonological Opacity Effects in Optimality Theory (2008), IULC Publications, Bloomington, Indiana 119-145
    • (2008) IUWPL6: Phonological Opacity Effects in Optimality Theory , pp. 119-145
    • Farris-Trimble, A.1
  • 13
    • 85045165547 scopus 로고    scopus 로고
    • Nothing is better than being unfaithful in multiple ways
    • Bane, M, J. Bueno, T. Grano, A. Grotberg, Y. McNabb Eds, Chicago Linguistic Society, Chicago
    • Farris-Trimble, A. 2009. Nothing is better than being unfaithful in multiple ways. In: Bane, M., J. Bueno, T. Grano, A. Grotberg, Y. McNabb (Eds.), Proceedings of the 44th Annual Meeting of the Chicago Linguistic Society, pp. 79-94. Chicago Linguistic Society, Chicago.
    • (2009) Proceedings of the 44th Annual Meeting of the Chicago Linguistic Society , pp. 79-94
    • Farris-Trimble, A.1
  • 19
    • 43949131690 scopus 로고    scopus 로고
    • A maximum entropy model of phonotactics and phonotactic learning
    • Hayes B., and Wilson C. A maximum entropy model of phonotactics and phonotactic learning. Linguistic Inquiry 39 (2008) 379-440
    • (2008) Linguistic Inquiry , vol.39 , pp. 379-440
    • Hayes, B.1    Wilson, C.2
  • 21
    • 33748691178 scopus 로고    scopus 로고
    • The winner takes it all-almost: cumulativity in grammatical variation
    • Jäger G., and Rosenbach A. The winner takes it all-almost: cumulativity in grammatical variation. Linguistics 44 (2006) 937-971
    • (2006) Linguistics , vol.44 , pp. 937-971
    • Jäger, G.1    Rosenbach, A.2
  • 22
    • 77949874409 scopus 로고    scopus 로고
    • Gradual learning and faithfulness: consequences of ranked vs. weighted constraints
    • Abdurrahman M., Schardl A., and Walkow M. (Eds). GLSA, Amherst, MA
    • Jesney K., and Tessier A.-M. Gradual learning and faithfulness: consequences of ranked vs. weighted constraints. In: Abdurrahman M., Schardl A., and Walkow M. (Eds). Proceedings of the 38th Meeting of the North East Linguistics Society (NELS 38). GLSA, Amherst, MA (2008)
    • (2008) Proceedings of the 38th Meeting of the North East Linguistics Society (NELS 38)
    • Jesney, K.1    Tessier, A.-M.2
  • 29
    • 0037030641 scopus 로고    scopus 로고
    • Computational and evolutionary aspects of language
    • Nowak M.A., Komarova N.L., and Niyogi P. Computational and evolutionary aspects of language. Nature 417 (June 2002) 611-617
    • (2002) Nature , vol.417 , pp. 611-617
    • Nowak, M.A.1    Komarova, N.L.2    Niyogi, P.3
  • 30
    • 77949874902 scopus 로고    scopus 로고
    • Weighted constraints in generative linguistics
    • Pater, J., 2009. Weighted constraints in generative linguistics. Cognitive Science 33, 999-1035.
    • (2009) Cognitive Science , vol.33 , pp. 999-1035
    • Pater, J.1
  • 31
    • 47949085661 scopus 로고    scopus 로고
    • Ms, University of Massachusetts at Amherst ROA-924 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • Pater J., Bhatt R., and Potts C. Linguistic Optimization (2007), Ms, University of Massachusetts at Amherst. http://roa.rutgers.edu ROA-924 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • (2007) Linguistic Optimization
    • Pater, J.1    Bhatt, R.2    Potts, C.3
  • 34
    • 43949101593 scopus 로고    scopus 로고
    • Anything goes
    • Honma T., Okazaki M., Tabata T., and Tanaka S. (Eds), Kaitakusha, Tokyo
    • Prince A. Anything goes. In: Honma T., Okazaki M., Tabata T., and Tanaka S. (Eds). A New Century of Phonology and Phonological Theory (2002), Kaitakusha, Tokyo 66-90
    • (2002) A New Century of Phonology and Phonological Theory , pp. 66-90
    • Prince, A.1
  • 35
    • 57049172240 scopus 로고    scopus 로고
    • Ms, Rutgers University ROA-500 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • Prince A. Entailed Ranking Arguments (2002), Ms, Rutgers University. http://roa.rutgers.edu ROA-500 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • (2002) Entailed Ranking Arguments
    • Prince, A.1
  • 36
    • 77949873190 scopus 로고    scopus 로고
    • Prince, A., 2007. Let the decimal system do it for you: a very simple utility function for OT. ROA 934 1207 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu)).
    • Prince, A., 2007. Let the decimal system do it for you: a very simple utility function for OT. ROA 934 1207 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu)).
  • 37
    • 77949872930 scopus 로고    scopus 로고
    • Prince, A., Smolensky, P., 1993/2004. Optimality theory: constraint interaction in generative grammar. ROA-537 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu)).
    • Prince, A., Smolensky, P., 1993/2004. Optimality theory: constraint interaction in generative grammar. ROA-537 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu)).
  • 38
    • 77949873267 scopus 로고    scopus 로고
    • Ms, University of Chicago. Draft available at
    • Riggle, J., 2008. Counting Rankings. Ms, University of Chicago. Draft available at http://hum.uchicago.edu/~jriggle/.
    • (2008) Counting Rankings
    • Riggle, J.1
  • 39
    • 62449250182 scopus 로고    scopus 로고
    • The complexity of ranking hypotheses in optimality theory
    • Riggle J. The complexity of ranking hypotheses in optimality theory. Computational Linguistics 35 (2009) 47-59
    • (2009) Computational Linguistics , vol.35 , pp. 47-59
    • Riggle, J.1
  • 40
    • 33845229699 scopus 로고    scopus 로고
    • Ms, Rutgers University ROA-363 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • Samek-Lodovici V., and Prince A. Optima (1999), Ms, Rutgers University. http://roa.rutgers.edu ROA-363 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • (1999) Optima
    • Samek-Lodovici, V.1    Prince, A.2
  • 41
    • 77949873778 scopus 로고    scopus 로고
    • Smolensky, P., 1995. On the Structure of the Constraint Component CON of UG. Handout to Talk Presented at University of California at Los Angeles, April 7, 1995. ROA-86 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
    • Smolensky, P., 1995. On the Structure of the Constraint Component CON of UG. Handout to Talk Presented at University of California at Los Angeles, April 7, 1995. ROA-86 (ROA = Rutgers Optimality Archive (http://roa.rutgers.edu))
  • 43
    • 84922269038 scopus 로고    scopus 로고
    • Computational models of language universals: expressiveness, learnability and consequences
    • Christiansen M., Collins C., and Edelman S. (Eds), Oxford University Press
    • Stabler E. Computational models of language universals: expressiveness, learnability and consequences. In: Christiansen M., Collins C., and Edelman S. (Eds). Language Universals (2009), Oxford University Press 200-223
    • (2009) Language Universals , pp. 200-223
    • Stabler, E.1
  • 47
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • Vapnik V.N., and Chervonenkis A. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 (1971) 264-280
    • (1971) Theory of Probability and its Applications , vol.16 , pp. 264-280
    • Vapnik, V.N.1    Chervonenkis, A.2
  • 48
    • 60949554180 scopus 로고    scopus 로고
    • Constraint weighting and constraint domination: a formal comparison
    • Zhang J. Constraint weighting and constraint domination: a formal comparison. Phonology 24 03 (2007) 433-459
    • (2007) Phonology , vol.24 , Issue.3 , pp. 433-459
    • Zhang, J.1


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