tag:blogger.com,1999:blog-8216930037889709643.post1220298630325238965..comments2023-06-11T00:31:55.052-07:00Comments on You Infinite Snake: Graphing EnglishUnknownnoreply@blogger.comBlogger4125tag:blogger.com,1999:blog-8216930037889709643.post-32483215719183139672010-01-12T13:39:42.447-08:002010-01-12T13:39:42.447-08:00Whoa! Had thought of a similar idea while creating...Whoa! Had thought of a similar idea while creating a quiz with a friend and though we did not actually sit down coding it, we did figure out the logic you explained and anticipated this result, though naively so. What I wonder now is that if we were to conduct a simple experiment wherein we create a simple language with suppose 13 literals and impose rules of grammar and synonymy like grammar: literals should not repeat more than twice and no two adjacent literals be adjacent in any word; synonymy: some randomly generated database(because imposition of rule would simply make the graph structure dependent on it), then would the number of literals in the word at the current node affect the result? will the result be a function of the algorithm or its implementation used?bin-ithttps://www.blogger.com/profile/06531523265860774902noreply@blogger.comtag:blogger.com,1999:blog-8216930037889709643.post-68820682493873083602008-09-05T11:54:00.000-07:002008-09-05T11:54:00.000-07:00Great program! Should be more popular than it curr...Great program! Should be more popular than it currently is.Unknownhttps://www.blogger.com/profile/06522212024252543118noreply@blogger.comtag:blogger.com,1999:blog-8216930037889709643.post-13530445827861133952008-08-16T01:25:00.000-07:002008-08-16T01:25:00.000-07:00őőps. Unicode translation issues...őőps. Unicode translation issues...Anonymoushttps://www.blogger.com/profile/13177925339061636642noreply@blogger.comtag:blogger.com,1999:blog-8216930037889709643.post-83250681512889348732008-08-15T18:47:00.000-07:002008-08-15T18:47:00.000-07:00you misspelled Erdős =)you misspelled Erdős =)Anonymousnoreply@blogger.com