Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Bootstrapping shared vocabulary in a population - weighted lists with probabilistic choice
Download
index.pdf
Date
2011
Author
Eryılmaz, Kerem
Metadata
Show full item record
Item Usage Stats
149
views
49
downloads
Cite This
Works on semiotic dynamics and language as a complex adaptive system in general has been an important lane of research over the last decade. In this study, the mean-field naming game model developed in the course of the pioneering research programme of Luc Steels and colleagues is modified to include probabilistic word choice based on weighted lists of words, instead of either deterministic or totally random word choice based on (ordered) sets of words. The parameters’ interaction and this interaction’s eff ect on time of convergence of the system and size of individual lexicons over time are investigated. The classical model is found to be a special case of this proposed model. Additionally, this model has more parameters and a larger state space which provides additional room for tweaking for time- or space-optimization of the convergence process.
Subject Keywords
Languages, Artificial.
URI
http://etd.lib.metu.edu.tr/upload/12613691/index.pdf
https://hdl.handle.net/11511/21109
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
Hierarchical decision making and decision fusion
Beldek, Ulas; Leblebicioğlu, Mehmet Kemal (2007-01-01)
In this study, a hierarchical decision making structure possessing a decision fusion technique is proposed in order to solve decision making problems efficiently. The proposed structure mainly depends on effects of the decisions made in the lower levels to decisions in the upper levels up to an activation degree. The proposed hierarchical structure is used for detecting the fault degrees for single and multiple fault scenarios artifically generated in a four tank system. The results obtained demonstrate the...
Pattern recognition in bistable networks
VLADIMIR, CHINAROV; Halıcı, Uğur; Leblebicioğlu, Mehmet Kemal (1999-04-08)
Present study concerns the problem of learning, pattern recognition and computational abilities of a homogeneous network composed from coupled bistable units. An efficient learning algorithm is developed. New possibilities for pattern recognition may be realized due to the developed technique that permits a reconstruction of a dynamical system using the distributions of its attractors. In both cases the updating procedure for the coupling matrix uses the minimization of least-mean-square errors between the ...
An examination of quantifier scope ambiguity in Turkish
Kurt, Kürşad; Bozşahin, Hüseyin Cem; Department of Cognitive Sciences (2006)
This study investigates the problem of quantifier scope ambiguity in natural languages and the various ways with which it has been accounted for, some of which are problematic for monotonic theories of grammar like Combinatory Categorial Grammar (CCG) which strive for solutions that avoid non-monotonic functional application, and assume complete transparency between the syntax and the semantics interface of a language. Another purpose of this thesis is to explore these proposals on examples from Turkish and...
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic
Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01)
In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
Formation preserving path finding in 3-D terrains
Bayrak, Ali Galip; Polat, Faruk (Springer Science and Business Media LLC, 2012-03-01)
Navigation of a group of autonomous agents that are required to maintain a formation is a challenging task which has not been studied much especially in 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents preserving a predefined formation in 3-D terrains. The proposed method could be used in many areas like navigation of semi-automated forces (SAF) at unit level in military simulations and non-player characters (NPC) in computer games. The proposed path findi...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
K. Eryılmaz, “Bootstrapping shared vocabulary in a population - weighted lists with probabilistic choice,” M.S. - Master of Science, Middle East Technical University, 2011.
