메뉴 건너뛰기




Volumn 22, Issue 7-8, 2008, Pages 707-729

An unsupervised incremental learning algorithm for domain-specific language development

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION AREA; COMPUTATIONAL BIOLOGY; CONTEXT-FREE GRAMMARS; DOMAIN EXPERTS; DOMAIN-SPECIFIC LANGUAGE; DOMAIN-SPECIFIC LANGUAGES; ENGINEERING DOMAINS; GRAMMAR INDUCTION; GRAMMAR INFERENCE; INCREMENTAL LEARNING; INFERENCE SYSTEMS; LEGACY SOFTWARES; PROGRAMMING LANGUAGE DESIGN; PROGRAMMING LANGUAGES;

EID: 49749096069     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510802164127     Document Type: Conference Paper
Times cited : (18)

References (39)
  • 2
    • 33845239507 scopus 로고    scopus 로고
    • Learning shallow context-free languages under simple distributions
    • eds. A. Copestake and K. Vermeulen. Chicago, IL: University of Chicago Press
    • Adriaans, P. 2001. Learning shallow context-free languages under simple distributions, In Algebras, Diagrams and Decisions in Language, Logic and Computation, CSLI/CUP. eds. A. Copestake and K. Vermeulen. Chicago, IL: University of Chicago Press.
    • (2001) Algebras, Diagrams and Decisions in Language, Logic and Computation, CSLI/CUP
    • Adriaans, P.1
  • 3
    • 33846012075 scopus 로고    scopus 로고
    • Aho, A. V, M. S. Lam, R. Sethi, and J. D. Ullman. 2007. Compiler:, 2nd ed. Boston, MA: Addison Wesley
    • Aho, A. V., M. S. Lam, R. Sethi, and J. D. Ullman. 2007. Compiler: Principles, Techniques, and Tools. 2nd ed. Boston, MA: Addison Wesley.
    • Principles, Techniques, and Tools
  • 5
    • 0003177228 scopus 로고    scopus 로고
    • 1.981. A note on the number of queries needed to identify regular languages
    • Angluin, D. 1.981. A note on the number of queries needed to identify regular languages. Information and Control 51 (1):76-87.
    • Information and Control , vol.51 , Issue.1 , pp. 76-87
    • Angluin, D.1
  • 6
    • 19944381418 scopus 로고
    • Learning regular sets from queries and counterexamples
    • Angluin, D. 1987. Learning regular sets from queries and counterexamples. Information and Control 39(2):337-350.
    • (1987) Information and Control , vol.39 , Issue.2 , pp. 337-350
    • Angluin, D.1
  • 8
    • 84867439480 scopus 로고    scopus 로고
    • Črepinšek, M., M. Mernik, B. R. Bryant, F. Javed, and A. Sprague. 2006. Context-free grammar inference for domain-specific languages, Technical report UABCIS-TR-2006-0301-1, Dept. of Computer & Info. Sciences, UAB, http://www.cis.uab.edu/softcom/GenParse/SCP05.ps, January 15, 2008.
    • Črepinšek, M., M. Mernik, B. R. Bryant, F. Javed, and A. Sprague. 2006. Context-free grammar inference for domain-specific languages, Technical report UABCIS-TR-2006-0301-1, Dept. of Computer & Info. Sciences, UAB, http://www.cis.uab.edu/softcom/GenParse/SCP05.ps, January 15, 2008.
  • 10
    • 33750296442 scopus 로고    scopus 로고
    • Inferring grammar rules of programming language dialects
    • Proceedings of the 8th International Colloquium on Grammatical Inference: Algorithms and Applications, ICGI 2006, Tokyo, Japan: Springer
    • Dubey, A., P. Jalote, and S. K. Aggarwal. 2006. Inferring grammar rules of programming language dialects. In Proceedings of the 8th International Colloquium on Grammatical Inference: Algorithms and Applications, ICGI 2006, Lecture Notes in Computer Science 4201, 201-213, Tokyo, Japan: Springer.
    • (2006) Lecture Notes in Computer Science , vol.4201 , pp. 201-213
    • Dubey, A.1    Jalote, P.2    Aggarwal, S.K.3
  • 11
    • 0027636611 scopus 로고
    • Learning and development in neural networks: The importance of starting small
    • Elman, J. L. 1993. Learning and development in neural networks: The importance of starting small. Cognition 48:71-99.
    • (1993) Cognition , vol.48 , pp. 71-99
    • Elman, J.L.1
  • 12
    • 49949150022 scopus 로고
    • Language identification in the limit
    • Gold, E. M. 1967. Language identification in the limit. Information and Control 10(5):447-474.
    • (1967) Information and Control , vol.10 , Issue.5 , pp. 447-474
    • Gold, E.M.1
  • 18
    • 33746216410 scopus 로고    scopus 로고
    • KM3: A DSL for metamodel specification
    • Proceedings of 8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems. Springer-Verlag, Bologna, Italy
    • Jouault, F. and J. Bézivin. 2006. KM3: a DSL for metamodel specification. In Proceedings of 8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems. Springer-Verlag, Lecture Notes in Computer Science, 4037, 171-185, Bologna, Italy.
    • (2006) Lecture Notes in Computer Science , vol.4037 , pp. 171-185
    • Jouault, F.1    Bézivin, J.2
  • 19
    • 19944397500 scopus 로고    scopus 로고
    • Natural language grammar induction with a generative constituent context model
    • Klein, D. and C. D. Manning, 2005. Natural language grammar induction with a generative constituent context model. Pattern Recognition 38(9):1401-1419.
    • (2005) Pattern Recognition , vol.38 , Issue.9 , pp. 1401-1419
    • Klein, D.1    Manning, C.D.2
  • 20
    • 33745193493 scopus 로고    scopus 로고
    • It's time to think outside the computational box
    • Kugel, P. 2005. It's time to think outside the computational box. Communications of the ACM 48(11): 32-37.
    • (2005) Communications of the ACM , vol.48 , Issue.11 , pp. 32-37
    • Kugel, P.1
  • 21
    • 0035505416 scopus 로고    scopus 로고
    • Cracking the 500 language problem
    • Lämmel, R. and C. Verhoef. 2001. Cracking the 500 language problem. IEEE Software 18(6):78-88.
    • (2001) IEEE Software , vol.18 , Issue.6 , pp. 78-88
    • Lämmel, R.1    Verhoef, C.2
  • 22
    • 84947908042 scopus 로고    scopus 로고
    • Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm
    • Proceedings of the Fourth International Colloquium on Grammatical Inference. Ames, IA: Springer-Verlag
    • Lang, K. J., B. A. Pearlmutter, and R. A. Price. 1998. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In Proceedings of the Fourth International Colloquium on Grammatical Inference. Ames, IA: Springer-Verlag, Lecture Notes in Computer Science, 1433.
    • (1998) Lecture Notes in Computer Science , vol.1433
    • Lang, K.J.1    Pearlmutter, B.A.2    Price, R.A.3
  • 25
    • 33745167684 scopus 로고    scopus 로고
    • When and how to develop domain-specific languages
    • Mernik, M., J. Heering, and T. Sloane. 2005. When and how to develop domain-specific languages. ACM Computing Surveys 37(4):316-344.
    • (2005) ACM Computing Surveys , vol.37 , Issue.4 , pp. 316-344
    • Mernik, M.1    Heering, J.2    Sloane, T.3
  • 27
    • 0003529332 scopus 로고    scopus 로고
    • Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies
    • Department of Electrical Engineering and Computer Science, University of Siegen
    • Merz, P. 2000. Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies. PhD diss., Department of Electrical Engineering and Computer Science, University of Siegen.
    • (2000) PhD diss
    • Merz, P.1
  • 28
    • 19944399790 scopus 로고    scopus 로고
    • Incremental learning of context-free grammars based on bottom-up parsing and search
    • Nakamura, K and M. Matsumoto. 2005. Incremental learning of context-free grammars based on bottom-up parsing and search. Pattern Recognition 38(9):1384-1392.
    • (2005) Pattern Recognition , vol.38 , Issue.9 , pp. 1384-1392
    • Nakamura, K.1    Matsumoto, M.2
  • 31
    • 84976834682 scopus 로고    scopus 로고
    • 1.995. Attribute grammar paradigms-A high-level methodology in language implementation
    • Paakki, J. 1.995. Attribute grammar paradigms-A high-level methodology in language implementation. ACM Computing Surveys 27 (2):196-255.
    • ACM Computing Surveys , vol.27 , Issue.2 , pp. 196-255
    • Paakki, J.1
  • 32
    • 0002645349 scopus 로고
    • Learning automata from ordered examples
    • Porat, S. and A. J. Feldman. 1991. Learning automata from ordered examples. Machine Learning 7:109-138.
    • (1991) Machine Learning , vol.7 , pp. 109-138
    • Porat, S.1    Feldman, A.J.2
  • 36
    • 0001813087 scopus 로고    scopus 로고
    • Domain-specific languages: An annotated bibliography
    • van Deursen, A., P. Klint, and J. Visser. 2000. Domain-specific languages: An annotated bibliography. ACM SIGPLAN Notices 35(6):26-36.
    • (2000) ACM SIGPLAN Notices , vol.35 , Issue.6 , pp. 26-36
    • van Deursen, A.1    Klint, P.2    Visser, J.3
  • 37
    • 84928037990 scopus 로고    scopus 로고
    • Domain-specific language design requires feature descriptions. journal of Computing and Information
    • van Deursen, A. and P. Klint. 2002. Domain-specific language design requires feature descriptions. journal of Computing and Information Technology 10(1):1-17.
    • (2002) Technology , vol.10 , Issue.1 , pp. 1-17
    • van Deursen, A.1    Klint, P.2


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