![]() A Markov chain is basically a probabilistic model for generating sequences. Markov chainsĪnother way to generate pronounceable words is the use of Markov chains. The problem with the last approach is that words without vowels sound pretty leetspeak-ish and there’s also no good reason why a username should have no vowels in it. In fact this was my first “real world” application of Clojure. Since I’m still in the process of learning Clojure I thought this would be some good practice too. The transformation is to remove all the vowels from the word which leaves us with something that is still kind-of pronounceable while also having a higher chance of not being taken.Īt first I’ve implemented this in JavaScript, but I realized that transforming data like this is a nice fit for Clojure. It’s located at either /usr/dict/words or /usr/share/dict/words.Īs discussed earlier using dictionary words isn’t possible, but by applying a little transformation can turn them into something more likely to be available. If you are using a UNIX-based operating system there is a file containing a lot of English words on your computer. ![]() This is obviously the most naive approach and most of the results won’t be pronounceable, but at least is is relatively easy to find a combination that is available (as of early 2015).īasically I could have stopped there but having lots of tools available, doing something more advanced is was just too tempting. It offers a random string generator, that can generate up to 10,000 random five-letter strings at a time. However, since availability on Twitter usually implies availability on most other services, filling out Twitter’s signup form also works. The goal of the post is to document the process of me overcomplicating a simple matter and to showcase the tools that made it possible, so you can overcomplicate things too.Ĭertainly the most important tool is a username checker like, which allows to check the availability of a username across multiple sites. ![]() So finding a user name that is at least (semi-) pronounceable is as good as it can get. ![]() Even with five, there are probably no combinations left that are also words in a dictionary. Why five? Well, all of the two-, three- and four-letter ones are gone. There are 11,881,376 five-letter combinations and I wanted one of them as my username. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |