Abney, S., R. Schapire, and Y. Singer (1999). Boosting applied to tagging and pp attachment. | ||
Adriaans, P. (1999). Learning shallow context-free languages under simple distributions. Volume 127. University of Stanford: CSLI-publications. | ||
Aha, D. W. (1997). Lazy learning: Special issue editorial. Artificial Intelligence Review 11, 7-10. | ||
Aha, D. W., D. Kibler, and M. Albert (1991). Instance-based learning algorithms. Machine Learning 6, 37-66. | ||
Allexandre, C. and A. Popescu-Belis (1998a). Emergence of grammatical conventions in an agent population using a simplified tree adjoining grammar. In ICMAS98, Paris, pp. 383-384. poster. | UIUC | |
Allexandre, C. and A. Popescu-Belis (1998b). Emergence of simplified tree adjoining grammar conventions in an agent population. | ||
Antonisse, H. J. (1991). A grammar-based genetic algorithm. In G. J. E. Rawlings (Ed.), Foundations of genetic algorithms, pp. 193-204. San Mateo: Morgan Kaufmann. | ||
Argamon, S., I. Dagan, and Y. Krymolowski (1998). A memory-based approach to learning shallow natural language patterns. In Proc. of 36th annual meeting of the ACL, Montreal, pp. 67-73. | ||
Argamon, S., I. Dagan, and Y. Krymolowski (1999). A memory-based approach to learning shallow natural language patterns. Special Issue on Memory-Based Language Processing, Journal of Experimental and Theoretical Artificial Intelligence 11 (3). | ||
Baker, J. (1979). Trainable grammars for speech recognition. In Proceedings of the 97th Meeting of the Acoustical Society of America, pp. 547-550. | ||
Baldwin, J. M. (1896). A new factor in evolution. American Naturalist 30, 441-451. | ||
Banko, M. and E. Brill (2001). Scaling to very very large corpora for natural language disambiguation. In 01, Toulouse, France. | ||
Batali, J. (1998a). Computational simulations of the emergence of grammar. In M. S.-K. J. R. Hurford and C. Knight (Eds.), Approaches to the Evolution of Language Social and Cognitive Bases. Cambridge: Cambridge University Press. | UIUC | |
Batali, J. (1998b). Computational simulations of the emergence of grammar. in approaches to the evolution of language: Social and cognitive bases. In M. S.-K. J.R. Hurford and C. K. (eds) (Eds.), Approaches to the Evolution of Language: Social and Cognitive Bases, pp. 405-426. Cambridge: Cambridge University Press. | ||
Batali, J. (2002). The negotiation and acquisition of recursive grammars as a result of competition among exemplars. In T. Briscoe (Ed.), Linguistic Evolution through Language Acquisition: Formal and Computational Models, Chapter 5. Cambridge University Press. | UIUC | |
Belz, A. (2001). Optimisation of corpus-derived probabilistic grammars. In Proceedings of Corpus Linguistics 2001, Lancaster University, UK, pp. 46-57. | ||
Bickerton, D. (1990). Language and Species. | UIUC | |
Black, E., R. Garside, and G. Leech (1993). Statistically-driven computer grammars of English. Amsterdam, The Netherlands: Rodopi. | ||
Blasband, M. (1998). Gag genetic algorithms for grammar. Technical report, Compuleer. | ||
Bledsoe, W. (1961). The use of biological concepts in the analytical study of systems. In Proceedings of the ORSA-TIMS National Meeting, San Francisco. | ||
Bod, R. (1995). Enriching linguistics with statistics: Performance models of natural language. Dissertation, ILLC, Universiteit van Amsterdam. | ||
Bod, R. (1996). EÆcient algorithms for parsing the DOP model? A reply to joshua goodman. http://xxx.lanl.gov/abs/cmp-lg/9605031. | ||
An Experience-Based Theory of Language | ||
Bod, R. (2000). Parsing with the shortest derivation. In Proceedings of the 18th International Conference on Computational Linguistics. Saarbruecken, Germany. | ||
Bod, R. (2001). What is the minimal set of fragments that achieves maximal parse accuary? In Prodeedings of ACL-EACL 2001. | ||
Box, G. (1957). Evolutionary operation: A method for increasing industrial productivity. Journal of the Royal Statistical Society 6(2). | ||
Breiman, L. (1996). Bagging predictors. Machine Learning 24 (2). | ||
Brighton, H. (2002). Compositional syntax from cultural transmission. Artificial Life 8 (1). eprint-ID: taal00000010. | UIUC | |
Brighton, H. and S. Kirby (2001a). Meaning space structure determines the stability of culturally evolved compositonal language. Technical report, Language Evolution and Computation Research Unit, Department of Theoretical and Applied Linguistics, The University of Edinburgh. | UIUC | |
Brighton, H. and S. Kirby (2001b). The survival of the smallest: Stability conditions for the cultural evolution of compositional language. In J. Kelemen and P. Sosk (Eds.), ECAL01, pp. 592-601. Springer-Verlag. | UIUC | |
Brill, E. and P. Resnik (1994). A rule-based approach to prepositional phrase attachment disambiguation. In Proc. of 15th annual conference on Computational Linguistics. | ||
Briscoe, E. (1998). Language as a complex adaptive system: co-evolution of language and of the language acquisition device. In Proceedings of the 8th Meeting of Comp. Linguistics in the Netherlands, Amsterdam, pp. pp. 3-40. Rodopi. | UIUC | |
Briscoe, E. (1999a). The acquisition of grammar in an evolving population of language agents. Machine Intelligence, 16: Electronic Transactions in Artificial Intelligence, Special Issue. | UIUC | |
Briscoe, E. (1999b). Grammatical acquisition: Co-evolution of language and the language acquisition device. In Evolutionary perspectives on diachronic syntax', Proceedings of the Diachronic Generative Syntax, Oxford. Oxford University Press. | UIUC | |
Briscoe, E. and J. Carroll (1993). Generalised probabilistic lr parsing for unification-based grammars. Computational Linguistics 19 (1), 25-60. | ||
Briscoe, T. (1997). Co-evolution of language and of the language acquisition device. In P. R. Cohen and W. Wahlster (Eds.), Proceedings of the Thirty-Fifth Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics, Somerset, New Jersey, pp. 418-427. Association for Computational Linguistics: Association for Computational Linguistics. | UIUC | |
Briscoe, T. and N. Waegner (1992). Robust stochastic parsing using the inside-outside algorithm. In AAAI '92 Workshop on ProbabilsticallyBased Natural Language Processing Techniques, pp. 39-53. | ||
Buchholz, S. (1998). Distinguishing complements from adjuncts using memory-based learning. In Proceedings of the ESSLLI-98 Workshop on Automated Acquisition of Syntax and Parsing, Saarbrucken, Germany. | ||
Buchholz, S. and W. Daelemans (2001, September). Shapaqa: Shallow parsing for question answering on the world wide web.. In Proceedings Euroconference Recent Advances in Natural Language Processing., pp. 47-51. Tsigov Chark, Bulgaria. | ||
Cardie, C. and D. Pierce (1998). Error-driven pruning of treebank grammars for base noun phrase identification. In Proc. of 36th annual meeting of the ACL, Montreal, pp. 218-224. | ||
Chandler, S. (1992). Are rules and modules really necessary for explaining language? Journal of Psycholinguistic research 22 (6), 593-606. | ||
Chappelier, J.-C. and M. Rajman (1998, ftp://ftp.inria.fr/INRIA/Projects/Atoll/TAPD98/chappelier.ps.gz). A generalized cyk algorithm for parsing stochastic cfg. In Proceedings of Tabulation in Parsing and Deduction (TAPD'98), Paris (FRANCE), pp. 133-137. | ||
Charniak, E. (1997, 27-31). Statistical parsing with a context-free grammar and word statistics. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), Menlo Park, pp. 598-603. AAAI Press. | ||
Charniak, E. (2000). A maximum-entropy-inspired parser. In Proceedings of NAACL'00, Seattle, USA, pp. 132-139. Charniak, E., G. Carroll, J. Adcock, A. Cassandra, Y. Gotoh, J. Catz, | ||
M. Littman, and J. McCann (1996). Taggers for parsers. Artificial Intelligence 85, 45-57. | ||
Chen, S. (1995). Bayesian grammar induction for language modeling. Proceedings of the association for computational linguistics, 228-235. Chitrao, M. and R. Grishman (199). Statistical parsing of messages. In Proceedings DARPA Speech and Language Workshop. | ||
Chomsky, N. (1957). Syntactic structures. Den Haag: Mouton. | ||
Clark, A. (2001). Unsupervised induction of stochastic context-free grammars using distributional clustering. In W. Daelemans and R. Zajac (Eds.), Proceedings of CoNLL-2001, Toulouse, France. | ||
Collins, M. (1997, july). Three generative, lexicalised models for statistical parsing. In 97. | ||
Collins, M. (1999). Head-driven Statistical Models for Natural Language Parsing. Ph. D. thesis, University of Pennsylvania, Pennsylvania, USA. | ||
Collins, M. (2000a). Discriminative reranking for natural language parsing. In Proceedings ICML-2000, Stanford, Ca. | ||
Collins, M. (2000b). Discriminative reranking for natural language parsing. In Proc. 17th International Conf. on Machine Learning, pp. 175-182. Morgan Kaufmann, San Francisco, CA. | ||
Cover, T. M. and P. E. Hart (1967). Nearest neighbor pattern classification. Institute of Electrical and Electronics Engineers Transactions on Information Theory 13, 21-27. | ||
D. Mitchell, F. C. and M. Corley (1992). Statistical versus linguistic determinants of parsing bias: Cross-linguistic evidence. In Fifth Annual CUNY Conference on Human Sentence Processing, New York. | ||
Daelemans, W. (1999). Memory-based language processing. Journal for Experimental and Theoretical Artificial Intelligence 11:3, 287-467. | ||
Daelemans, W., P. Berck, and S. Gillis (1997). Data mining as a method for linguistic analysis: Dutch diminutives. Folia Linguistica XXXI (1-2). | ||
Daelemans, W., S. Buchholz, and J. Veenstra (1999). Memory-based shallow parsing. In Proceedings of CoNLL, Bergen, Norway. | ||
Daelemans, W. and A. Van den Bosch (1992). Generalisation performance of backpropagation learning on a syllabification task. In M. F. J. Drossaers and A. Nijholt (Eds.), Proc. of TWLT3: Connectionism and Natural Language Processing, Enschede, pp. 27-37. Twente University. | ||
Daelemans, W., A. Van den Bosch, and A. Weijters (1997). igtree: using trees for compression and classification in lazy learning algorithms. Artificial Intelligence Review 11, 407-423. | ||
Daelemans, W., A. van den Bosch, and J. Zavrel (1999). Forgetting exceptions is harmful in language learning. Machine Learning, Special issue on Natural Language Learning . | ||
Daelemans, W., J. Zavrel, K. Van der Sloot, and A. Van den Bosch (1998). TiMBL: Tilburg Memory Based Learner, version 1.0, reference manual. Technical Report ILK-9803, ILK, Tilburg University. | ||
Daelemans, W., J. Zavrel, K. van der Sloot, and A. van den Bosch (2000). TiMBL: Tilburg memory based learner, version 3.0, reference guide. ILK Technical Report 00-01, Tilburg University. available from http://ilk.kub.nl. | ||
Daelemans, W., J. Zavrel, K. van der Sloot, and A. van den Bosch (2001). TiMBL: Tilburg memory based learner, version 4.0, reference guide. ILK Technical Report 01-04, Tilburg University. available from http://ilk.kub.nl. | ||
de Marcken, C. (1995). On the unsupervised induction of phrase-structure grammars. In Proceedings of the Third Workshop on Very Large Corpora. | ||
De Pauw, G. (2000a). Aspects of pattern-matching in dop. In Proceedings of the 18th International Conference on Computational Linguistics, pp. 236-242. | ||
De Pauw, G. (2000b). Probabilistische Parsers Contextgevoeligheid en Pattern-Matching. Antwerpen, Belgium: Antwerp Papers in Linguistics. | ||
De Pauw, G. and W. Daelemans (2000). The role of algorithm bias vs information source in learning algorithms for morphosyntactic disambiguation. In Proceedings of the Fourth Conference on Computational Language Learning (CoNLL-2000), Lisbon, Portugal, pp. 19-24. | ||
Dietterich, T. (2000). An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Machine Learning 40(2), 1-22. | ||
Dietterich, T. G. (1998). Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation 10 (7). | ||
Dik, S. C. (1997). The Theory of Functional grammar. Part 1: The Structure of the Clause. Berlin: Mouton de Gruyter. | ||
Dunbar, R. (1996). Grooming, gossip and the evolution of language. London: Faber. | UIUC | |
Dupont, P. (1994). Regular grammatical inference from positive and negative samples by genetic search: the gig method. In Grammatical Inference and Applications. Second International Colloquium ICGI-94: Springer Berlin. | ||
Fenk-Oczlon, G. (1989). Word frequency and word order in freezes. Linguistics 27, 517-556. | ||
Franz, A. (1996). Learning pp attachment from corpus statistics. In S. Wermter, E. Riloff, and G. Scheler (Eds.), Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, Volume 1040 of Lecture Notes in Artificial Intelligence, pp. 188-202. New York: Springer-Verlag. | ||
Fraser, A. (1957). Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Science 10. | ||
Freund, Y. and R. E. Shapire (1996). Experiments with a new boosting algorithm. In L. Saitta (Ed.), Proceedings of the Thirteenth International Conference on Machine Learning, San Francisco, CA, pp. 148-156. Morgan Kaufmann. | ||
Gillis, Steven, W. D. and G. Durieux (2000). Lazy learning: A comparison of natural and machine learning of stress. In P. Broeder and J. Murre (Eds.), Models of Language Acquisition: inductive and deductive approaches, pp. 76-99. Oxford University Press. | ||
Gold, E. M. (1967). Language identification in the limit. Information and Control 10, 447-474. | UIUC | |
Goodman, J. (1996). EÆcient algorithms for parsing the dop model. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp. 143-152. CEMNLP. | ||
Goodman, J. (1998). Parsing inside-out. | ||
Grunwald, P. (1994). A minimum description lenght approach to grammar inference. In S. W. G. Scheler and E. Riloff (Eds.), Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language, Volume 1004 of Lecture notes in AI, Berlin, pp. 203-216. Springer Verlag. | ||
Harris, Z. (1951). Methods in Structural Linguistics. Chicago, IL: University of Chicago Press. | ||
Hashimoto, T. and T. Ikegami (1996). The emergence of a net-grammar in communicating agents. Biosystems 38, 1-14. | UIUC | |
Hemphill, C., J. Godfrey, and G. Doddington (1990). The atis spoken language systems pilot corpus. | ||
Henderson, J. and E. Brill (2000). Bagging and boosting a treebank parser. | ||
Henderson, J. C. and E. Brill (1999). Exploiting diversity for natural language processing. In AAAI/IAAI, pp. 1174. | ||
Honkela, T., V. Pulkki, and T. Kohonen (1995). Contextual relations of words in Grimm tales, analyzed by self-organizing map. In F. Fogelman-Soulie and P. Gallinari (Eds.), Proc. ICANN'95, International Conference on Artificial Neural Networks, Volume II, Nanterre, France, pp. 3-7. EC2. | ||
Hoste, V. and W. Daelemans (2000). Comparing bagging and boosting for natural language processing tasks: a typicality approach. In Proceedings of the Tenth Belgian-Dutch Conference on Machine Learning (Benelearn 2000), Tilburg, The Netherlands, pp. 101-108. | ||
Huijsen, W.-O. (1993). Genetic grammatical inference: Induction of pushdown automata and context-free grammars from examples using genetic algorithms. Master's thesis, Enschede, The Netherlands. | ||
Hurford, J. (2000). The emergence of syntax. In J. R. H. Chris Knight and M. Studdert-Kennedy (Eds.), The Evolutionary Emergence of Language: Social Function and the Origins of Linguistic Form, pp. 219-230. Cambridge: Cambridge University Press. | UIUC | |
Jacoby, L. and L. Brooks (1994). Nonanalytic cognition: Memory, perception and concept learning. In G. Bower (Ed.), Psychology of Learning and Motivation, Volume 18, pp. 1-47. San Diego: Academic Press. | ||
Johnson, M. (1998). PCFG models of linguistic tree representations. Computational Linguistics 24 (4), 613-632. | ||
Kammeyer, T. and R. Belew (1996). Stochastic context-free grammar induction with a genetic algorithm using local search. Technical Report CS96-476, Cognitive Computer Science Research Group, University of California, San Diego. | ||
Keller, B. and R. Lutz (1997a). Evolving stochastic context-free grammars from examples using a minimum description length principle. In Workshop on Automata Induction, Grammatical Inference and Language Aquisition ICML-97. | ||
Keller, B. and R. Lutz (1997b). learning stochastic context-free grammars from examples from corpora using a genetic algorithm. In ICANNGA97. | ||
Kirby, S. (1999). Syntax out of learning: The cultural evolution of structured communication in a population of induction algorithms. In D. Floreano, J.-D. Nicoud, and F. Mondada (Eds.), Proceedings of the 5th European Conference on Advances in Artificial Life (ECAL-99), Volume 1674 of LNAI, Berlin, pp. 694-703. Springer. | UIUC | |
Kirby, S. (2000). Syntax without natural selection: How compositionality emerges from vocabulary in a population of learners. In C. Knight (Ed.), The Evolutionary Emergence of Language: Social Function and the Origins of Linguistic Form, pp. 303-323. Cambridge University Press. | UIUC | |
Kirby, S. (2001). Spontaneous evolution of linguistic structure: an iterated learning model of the emergence of regularity and irregularity. IEEE Transactions on Evolutionary Computation 5 (2), 102-110. | UIUC | |
Kirby, S. (2002a). Learning, bottlenecks and the evolution of recursive syntax. In T. Briscoe (Ed.), Linguistic Evolution through Language Acquisition: Formal and Computational Models, Chapter 6. Cambridge University Press. | UIUC | |
Kirby, S. (2002b). Natural language from artificial life. Artificial Life. eprint-ID: taal00000037. | UIUC | |
Kirby, S. and J. Hurford (2001). The emergence of linguistic structure: An overview of the iterated learning model. In A. Cangelosi and D. Parisi (Eds.), Simulating the Evolution of Language, Chapter 6, pp. 121-148. London: Springer Verlag. | UIUC | |
Klein, D. and C. D. Manning (2001). Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the penn treebank. In Prodeedings of ACL-EACL 2001. | ||
Koehn, P. (2002). Combining multiclass maximum entropy text classifiers with neural network voting. | ||
Kolodner, J. (1993). Case-based reasoning. San Mateo, CA: Morgan Kaufmann. | ||
Komarova, N. and M. Nowak (2001a). Population dynamics of grammar acquisition. In A. Cangelosi and D. Parisi (Eds.), Simulating the Evolution of Language, Chapter 7, pp. 149-164. London: Springer Verlag. | UIUC | |
Komarova, N. L., P. Niyogi, and M. A. Nowak (2001). The evolutionary dynamics of grammar acquisition. Journal of Theoretical Biology 209 (1), 43-59. | UIUC | |
Komarova, N. L. and M. Nowak (2001b). Natural selection of the critical period for language acquisition. Proceedings of The Royal Society of London. Series B, Biological Sciences 268 (1472), 1189-1196. | UIUC | |
Kool, A. (1999). Literature survey. | ||
Langacker, R. (1987). Foundations of Cognitive Grammar. Stanford, Ca: Stanford University Press. | UIUC | |
Langley, P. (1996). Elements of machine learning. San Mateo, CA: Morgan Kaufmann. | ||
Lankhorst, M. (1994). Breeding grammars: Grammatical inference with a genetic algorithm. Computer Science Report CS-R9401, University of Groningen, The Netherlands. | ||
Lari, K. and S. Young (1990). The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language 4(1), 35-56. | ||
Losee, R. (1995). Learning syntactic rules and tags with genetic algorithms for information retrieval and filtering: An empirical basis for grammatical rules. Information Processing and Management . | ||
Lucas, S. (1993). Biased chromosomes for grammatical inference. In Proceedings of Natural Algorithms in Signal Processing, Danbury Park, UK. IEE. | ||
Lucas, S. (1994). Context-free grammar evolution. In First International Conference on Evolutionary Computing. | ||
M. Redington, N. C. and S. Finch (1998). Distributional information: A powerful cue for acquiring syntactic categories. Cognitive Science 22(4), 425-469. | ||
Magerman, D. and M. Marcus (1990). Parsing a natural language using mutual information statistics. In Proc. of 8th. conference on AI (AAAI90), Volume 2, pp. 984-989. | ||
Magerman, D. M. (1995). Statistical decision-tree models for parsing. In 95. Marcus, M., G. Kim, M. A. Marcinkiewicz, R. MacIntyre, A. Bies, M. Ferguson, K. Katz, and B. Schasberger (1994). The penn treebank: Annotating predicate argument structure. In Proceedings of ARPA Human Technology Workshop, pp. 110-115. | ||
Marcus, M. P., B. Santorini, and M. Marcinkiewicz (1993). Building a large annotated corpus of english: the penn treebank. Computational linguistics 19, 313-330. Reprinted in Susan Armstrong, ed. 1994, Using large corpora, Cambridge, MA: MIT Press, 273-290. | ||
Matthews, P. H. (1997). The Concise Oxford Dictionary of Linguistics. Oxford: Oxford University Press. | ||
McLauchlan, M. (2001). Maximum entropy models and prepositional phrase ambiguity. | ||
Mel'cuk, I. A. (1988). Dependency syntax : theory and practice. SUNY Series in Linguistics. Albany: State University of New York Press. | ||
Mithen, S. (1996). The prehistory of the mind. London: Thames and Hudson. | ||
Mooney, R. J. (1996). Comparative experiments on disambiguating word senses: An illustration of the role of bias in machine learning. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP, pp. 82-91. | ||
Nowak, M., J. P. and V. A. A. Jansen (2000, March). The evolution of syntactic communication. Nature 404, 495-498. | UIUC | |
Nowak, M., N. L. Komarova, and P. Niyogi (2001). Evolution of universal grammar. Science 291, 114-118. | UIUC | |
Pereira, F. and Y. Shabes (1992). Inside-outside reestimation from partially bracketed corpora. In Proc. 29th annual meeting of the Association for computational linguistics, Berkeley, California, pp. 128-135. | ||
Pinker, S. and P. Bloom (1990). Natural language and natural selection. Behavioral and Brain Sciences 13(4), 707-784. | UIUC | |
Plotkin, J. B. and M. Nowak (2000). Language evolution and information theory. Journal of Theoretical Biology , 147-159. | UIUC | |
Quine, W. V. O. (1960). Word and Object. Cambridge: MIT Press. | ||
Quinlan, J. (1993). c4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann. | ||
Ramshaw, L. and M. Marcus (1995). Text chunking using transformationbased learning. In 95, pp. 82-94. | ||
Ratnaparkhi, A. (1997, June). A linear observed time statistical parser based on maximum entropy models. Technical Report cmp-lg/9706014, Computation and Language, http://xxx.lanl.gov/list/cmp-lg/. | ||
Ratnaparkhi, A. (1998). Maximum Entropy Models for Natural Language Ambiguity Resolution. Ph. D. thesis, University of Pennsylvania. | ||
Ratnaparkhi, A. (1999). Learning to parse natural language with maximum entropy models. Machine Learning 34, 151-175. | ||
Ratnaparkhi, A., J. Reynar, and S. Roukos (1994, March). A maximum entropy model for prepositional phrase attachment. In Workshop on Human Language Technology, Plainsboro, NJ. ARPA. | ||
Rostand, E. (1897). Cyrano De Bergerac. Distribooks Inc. | ||
Roth, D. (1998). Learning to resolve natural language ambiguities: A unified approach. In Proceedings of the National Conference on Artificial Intelligence, Menlo Park, CA, pp. 898-904. aaai Press. | ||
Roth, D. (1999). Memory based learning in NLP. Technical Report 2125, Urbana, Illinois. | ||
S. Buchholz, J. Veenstra, W. D. (1999). Cascaded grammatical relation assignment. In Proceedings of EMNLP/VLC-99, University of Maryland, USA. | ||
Scha, R. (1990). Taaltheorie en taaltechnologie: competence en performance. In Q. A. M. de Kort and G. L. J. Leerdam (Eds.), Computertoepassingen in de Neerlandistiek, LVVN-jaarboek, pp. 7-22. Almere: Landelijke Vereniging van Neerlandici. [Language theory and language technology: Competence and Performance] in Dutch. | ||
Scha, Bod, S. (1999). A memory-based model of syntactic analysis: dataoriented parsing. Journal of Experimental and Theoretical Artificial Intelligence 11:3, 409-440. | ||
Schapire, R. E. (1999). A brief introduction to boosting. In IJCAI, pp. 1401-1406. | ||
Schapire, R. E. and Y. Singer (2000). Boostexter: A boosting-based system for text categorization. Machine Learning 39 (2/3), 135-168. | ||
Schapire, R. E., Y. Singer, and A. Singhal (1998). Boosting and Rocchio applied to text filtering. In In Proceedings of the 21st Annual International Conference on Research and Development in Information Retrieval, SIGIR '98. | ||
Schoenemann, P. (1999). Syntax as an emergent characteristic of the evolution of semantic complexity. Minds and Machines 9, 309-346. | UIUC | |
Shannon, C. and W. Weaver (1949). The Mathematical Theory of Communication. Urbana, Illinois: University of Illinois Press. | ||
Sima'an, K. (1996). Computational complexity of probabilistic disambiguation by means of tree grammars. In Proceedings of the International Conference on Computational Linguistics (COLING '96), pp. pp.1175-1180 (vol. 2). | ||
Sima'an, K. (1999). Learning EÆcient Disambiguation. Ph. D. thesis, University of Amsterdam. | ||
Sima'an, K., R. Bod, S. Krauwer, and R. Scha (1994). EÆcient disambiguation by means of stochastic tree substitution grammars. In D. B. Jones and H. L. Somers (Eds.), Proc. of the Int. Conf. on New Methods in Language Processing. Manchester, UK, 14-16 Sep 1994, London, UK, pp. 50-58. UCL Press. | ||
Skousen, R. (1989). Analogical modeling of language. Dordrecht: Kluwer Academic Publishers. | ||
Sleator, D. and D. Temperley (1991). Parsing english with a link grammar. Technical report, CMU, Pittsburgh. | ||
Smith, A. D. (2001, September 10-14). Establishing communication systems without explicit meaning transmission. In J. Kelemen and P. Sosk (Eds.), ECAL01, Lectures Notes in Computer Science, Prague, pp. 381-390. Springer. | UIUC | |
Smith, T. C. and I. H. Witten (1996). Learning language using genetic algorithms. In S. Wermter, E. Riloff, and G. Scheler (Eds.), Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, Volume 1040 of LNAI, pp. 132-145. Berlin: Springer Verlag. | ||
Spears, W. M., K. A. De Jong, T. Back, D. B. Fogel, and H. de Garis (1993). An overview of evolutionary computation. In P. Brazdil (Ed.), Machine Learning: ECML-93, European Conference on Machine Learning, Vienna, Austria, April 5-7, 1993, Proceedings, Volume 667 of Lecture Notes in Computer Science, pp. 442-459. Springer. | ||
Steels, L. (1997). Synthesising the origins of language and meaning using co-evolution, selforganisation and level formation. In J. Hurford (Ed.), Evolution of Human Language, Edinburgh. Edinburgh Univ. Press. | UIUC | |
Steels, L. (1998a). The origin of linguistic categories. In The Evolution of Language Conference: Selected Papers from the 2nd international Conference on the Evolution of Language. | UIUC | |
Steels, L. (1998b). The origins of syntax in visually grounded robotic agents. Artificial Intelligence 103 (1-2), 133-156. | UIUC | |
Steels, L. (2000, August). The emergence of grammar in communicating autonomous robotic agents. In W. Horn (Ed.), ECAI2000, Amsterdam, pp. 764-769. IOS Press. | UIUC | |
Stolcke, A. and S. Omohundro (1994). Inducing probabilistic grammars by bayesian model merging. In International Conference on Grammatical Inference, unknown, pp. 999-999. unknown. | ||
Studdert-Kennedy, M. (1998). The particulate origins of language generativity: from syllable to gesture. In M. S.-K. J.R. Hurford and C. Knight (Eds.), Approaches to the Evolution of Language: Social and Cognitive Bases, pp. 202-221. Cambridge: Cambridge University Press. Tjong Kim Sang, E., W. Daelemans, W. D'ejean, H. Koeling, R. Krymolowski, Y. Punyakanok, and V. Roth (2000). Applying system combination to base noun phrase identification. | UIUC | |
Tjong Kim Sang, E. F. (2001). Transforming a chunker to a parser. In J. V. Walter Daelemans, Khalil Sima'an and J. Zavrel (Eds.), Computational Linguistics in the Netherlands 2000, pp. 177-188. Rodopi. | ||
Tjong Kim Sang, E. F. (2002). Memory-based shallow parsing. Journal of Machine Learning Research 2 (Mar), 559-594. | ||
Tonkes, B. (2001, October). On the Origins of Linguistic Structure: Computational models of the evolution of language. Ph. D. thesis, University of Queensland, Australia. Draft PhD thesis, 140 pages. | UIUC | |
van den Bosch, A. and S. Buccholz (2002). Shallow parsing on the basis of words only: A case study. In In Proceedings of the 40th Meeting of the Association for Computational Linguistics (ACL'02), Philadelphia. | ||
van Halteren, H., J. Zavrel, and W. Daelemans (1998, August 10-14). Improving data-driven wordclass tagging by system combination. In 98, Montreal, Canada, pp. 491-497. | ||
van Halteren, Hans, J. Z. and W. Daelemans (2001). Improving accuracy in word class tagging through combination of machine learning systems. Computational Linguistics 27 (2), 199-230. | ||
van Rijsbergen, C. (1975). Information Retrieval. Buttersworth. | ||
van Trijp, R. (2003). Modeling the evolution of syntax. Master's thesis, Dept of Germanic Languages, University of Antwerp. | ||
van Zaanen, M. (2002, January). Bootstrapping Structure into Language: Alignment-Based Learning. Ph. D. thesis, University of Leeds, Leeds, UK. | ||
van Zaanen, M. and P. Adriaans (2001, October). Alignment-Based Learning versus EMILE: A comparison. In Proceedings of the BelgianDutch Conference on Artificial Intelligence (BNAIC); Amsterdam, the Netherlands, pp. 315-322. | ||
Veenstra, J. B. (1998). Fast NP chunking using memory-based learning techniques. In Proceedings of BENELEARN'98, Wageningen, The Netherlands, pp. 71-78. | ||
Vilain, M. and D. Day (1996). Finite-state phrase parsing by rule sequences. In 96. | ||
Wolff, J. (1998). Learning syntax and meanings through optimization and distributional analysis. In M. B. Y Schlesinger Levy (Ed.), Categories and Processes in Language, Lawrence Erlbaum, pp. 85-98. Hillsdale NJ. | ||
Wray, A. (1998). Protolanguage as a holistic system for social interaction. Language and Communication 18, 47-67. | UIUC | |
Wray, A. (2000). A protolanguage with no declaratives and no names. In The Evolution of Language 3rd International Conference: Proceedings, Paris, France. | ||
Wyard, P. (1989). Representational issues for context-free grammar induction using genetic algorithms. Technical report, Natural Language Group, British Telecom, Ipswich UK. | ||
Wyard, P. (1991). Context-free grammar induction using genetic algorithms. In R. Belew and L. Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo. ICGA: Morgan Kaufmann. | ||
Yang, C. (2000). Knowledge and Learning in Natural Language. Ph. D. thesis, Yale University: MIT. | UIUC | |
Yuret, D. (1998). Discovery of Linguistic Relations Using Lexical Attraction. Ph. D. thesis, MIT, Cambridge, MA. | ||
Zavrel, J. and W. Daelemans (1997). Memory-based learning: Using similarity for smoothing. In Proc. of 35th annual meeting of the ACL, Madrid. | ||
Zavrel, J., W. Daelemans, and J. Veenstra (1997). Resolving PP attachment ambiguities with memory-based learning. In M. Ellison (Ed.), Proc. of the Workshop on Computational Language Learning (CoNLL'97), ACL, Madrid. | ||
Zhou, H. and J. Grefenstette (1986). Induction of finite automata by genetic algorithms. In Proceedings of the 1986 IEEE International Conference on Systems, Man and Cybernetics, Atlanta. | ||
Zuidema, W. (2000). Evolution of syntax in groups of agents. Master's thesis, Theoretical Biology, Utrecht University. | UIUC |
| HOME :: Back to the Paper :: References | Comments to: junwang4 you-know-at gmail.com | Last update: 11/16/07 |