Luke Metcalfe writes about how, since Google Code Search allows regular expressions, you can type a string and find out if it can be used as an acronym.
I can’t explain the search string required, but you need something like \s+N\w+\s+A\w+\s+T\w+\s+H\w+\s+A\w+\s+N\w+, and Code Search will find a word sequence that matches the letter sequence, assuming one exists in their index.
Philipp has made your job easier, by providing a search box you can type any word into, to get the results from Google, without any hard thinking.
Here are some:
- joe – just one example / jumble of extra
- fish – found if space has / For info see http
- carl – Clear any remaining live / create and remove lists
- coke – cache of known existence
- soda – styles of data access / Size of data actually / specified or defaulted attributes / select or delete all / shred of documentation about / start of desired area / standard options described above
- cola – count of locks against / consists of lines appearing / couple of lines ago / conditions or license agreements
- crap – computational resources and placing / carriage return and percent / command reports all people / can represent any possible
- dude – data using Data Encryption / Digital Unix default echo
- god – granting or denying / grows on demand / get old data / groups of directives / global operator delete / get our data / generates output data / gigabytes of data / group of documents / group of developers
- mom – most other machines / meaningful on MacOS / major or minor / minimum or maximum / missing or magic / matches our message / miss our man
Pretty cool. The “god” one is my favorite.
Word of the day: These are “backronyms”, words that start as acronyms that you find a set of words for.
Tag:
Add to 
Bookmark Murdok:
Nathan Weinberg writes the popular InsideGoogle blog, offering the latest news and insights about Google and search engines.
Visit the InsideGoogle blog.
