Search Results for author:
Found 19 papers, 11 papers with code
Evolution of Symbiosis in the Game of Life: Three Characteristics of Successful Symbiotes
When we measure the fitness of a symbiote by making it compete with other symbiotes, we find that fitter symbiotes have significantly more management, mutualism, and interaction than less fit symbiotes.
Measuring Behavioural Similarity of Cellular Automata
The Game of Life belongs to the set of semi-totalistic cellular automata, a family with 262, 144 members.
Evolution of Autopoiesis and Multicellularity in the Game of Life
We use the apgsearch software (Ash Pattern Generator Search), developed by Adam Goucher for the study of ashes, to analyze autopoiesis and multicellularity in Model-S. We find that the fitness of evolved seed patterns in Model-S is highly correlated with the diversity and quantity of multicellular autopoietic structures.
Conditions for Open-Ended Evolution in Immigration Games
The evidence suggests that a necessary and sufficient condition on the rules of Immigration Games, for open-ended evolution, is that the rules should allow growth.
The Natural Selection of Words: Finding the Features of Fitness
We introduce a dataset for studying the evolution of words, constructed from WordNet and the Google Books Ngram Corpus.
Symbiosis Promotes Fitness Improvements in the Game of Life
Mutation, reproduction, and symbiosis are implemented as operations that are external to the Immigration Game.
Conditions for Major Transitions in Biological and Cultural Evolution
More precisely, evolution by natural selection is a class of algorithms that share a set of properties.
Leveraging Term Banks for Answering Complex Questions: A Case for Sparse Vectors
While open-domain question answering (QA) systems have proven effective for answering simple questions, they struggle with more complex questions.
Semantic Composition and Decomposition: From Recognition to Generation
A test for semantic composition is, given context vectors for the noun and modifier in a noun-modifier bigram ("red salmon"), generate a noun unigram that is synonymous with the given bigram ("sockeye").
Experiments with Three Approaches to Recognizing Lexical Entailment
Two general strategies for RLE have been proposed: One strategy is to manually construct an asymmetric similarity measure for context vectors (directional similarity) and another is to treat RLE as a problem of learning to recognize semantic relations using supervised machine learning techniques (relation classification).
Distributional semantics beyond words: Supervised learning of analogy and paraphrase
There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous).
Domain and Function: A Dual-Space Model of Semantic Relations and Compositions
Given appropriate representations of the semantic relations between carpenter and wood and between mason and stone (for example, vectors in a vector space model), a suitable algorithm should be able to recognize that these relations are highly similar (carpenter is to wood as mason is to stone; the relations are analogous).
Computing Lexical Contrast
We then present an automatic and empirical measure of lexical contrast that relies on the contrast hypothesis, corpus statistics, and the structure of a {\it Roget}-like thesaurus.
Crowdsourcing a Word-Emotion Association Lexicon
Even though considerable attention has been given to the polarity of words (positive and negative) and the creation of large polarity lexicons, research in emotion analysis has had to rely on limited and small emotion lexicons.
Empirical Evaluation of Four Tensor Decomposition Algorithms
We recommend HOOI for tensors that are small enough for the available RAM and MP for larger tensors.
Self-Replication and Self-Assembly for Manufacturing
We demonstrate that a variety of polygonal meshes can be manufactured in the simulation, by simply changing the sequence of machine types in the seed.
Multiagent Systems Computational Engineering, Finance, and Science I.6.3; I.6.8; J.2; J.3
Measuring Semantic Similarity by Latent Relational Analysis
This paper describes the LRA algorithm and experimentally compares LRA to VSM on two tasks, answering college-level multiple-choice word analogy questions and classifying semantic relations in noun-modifier expressions.
Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews
A review is classified as recommended if the average semantic orientation of its phrases is positive.
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
PMI-IR is contrasted with Latent Semantic Analysis (LSA), which achieves a score of 64% on the same 80 TOEFL questions.
