goosh.org The unofficial google shell

As a linux user, I spend most of my time using the shell to do most of the work. I am a command line fan like a lot of people out there.

goosh.org is a command line based (Ajax web based) interface for google, created by Stefan Grothkopp. You just write your search query and the results will be listed for you in a very similar manner to command line programs.

Searching using goosh will still need you to use your mouse to open the results and continue browsing. Not a very suitable shell mode. Well, this haven't been the main usage of goosh (for me).
Instead, I have been using it heavily as my translator.

Instead of:
  1. Going to http://translate.google.com/ in the browser
  2. Writing the text to be translated
  3. Choosing the from/to languages from the drop down lists
  4. Clicking "Translate"
Goosh lets you get this by:
  1. Going to goosh.org
  2. typing the command following command and hitting Enter
    translate src dst sentence
    for example:
    translate en ar my name is mahmoud
    to get "اسمي محمود"
There are short aliases for the various commands to use. translate (also trans and t).

Goosh is pretty much easier and more comfartable to use once you know your commands and its arguments.

Type help (or its alias man) while you are at the goosh shell to see the list of available commands. (example: man translate)

You can use the up key to get the last command to reuse it in a similar manner of using the shell. This is quite usable.

Comments

Ahmed El Gamil said…
Cool ..
really useful for the shell geeks like us ;)
Thanks for the useful posts
1:43 AM
mahmoud said…
u r welcome my friend
2:26 AM
Michael M. Behman said…
If you're only using the shell for the translation, I use the web browser this way:
http://google.com/translate_t#en|ar|my name is mahmoud
I know it's more typing but it's more like opening a new shell window, running the script and typing the commands while firefox is always running in my case.

Michael Behman
11:52 PM
Pravin said…
Searching using goosh will still need you to use your mouse to open the results and continue browsing. Not a very suitable shell mode.

You don't need the mouse to open the results. Just type the result number and press Enter. :-)
7:23 AM
mahmoud said…
You are right Pravin.

I wasn't initially aware of all the keyboard shortcuts that is used with goosh.

Thanks for the tip
5:24 PM
Post a Comment

Popular posts from this blog

Success of Startups

Entrepreneurship has become one of the one of the most interesting topic in the business side in any country in the world. While it is digging its way in the middle east, there is some sort of confusion and a lot of aspects related to that topic. A Startup can act and advance to tackle business opportunities in a way that competes with large enterprises. and most of the times, they need to be supported by Investors to back them up. One of the things that started to really bother me in the culture is the definition of success of a startup. No one denies that a decent revenue generating startup is a successful one. However, some people believe that just raising an investment is a success.... umm, debatable. I believe we can make some kind of analogy with some entities that showed up in the past decade like biznas and skybiz (I'm sure some of you will remember those names).   they used an invalid scheme summarized as: People can register and join the network for a fee (as an i
Read more

Prime Numbers Generator

Image
did u know that 34136029 is a prime number?!! well.. that's what i recently realized :) I thought of writing a piece of code for that purpose.. wondering how far i can get. The idea of the code is simple We know that 2 and 3 are prime numbers the code checks every following odd numbers to be prime or not. To verify a prime number, the number divisibility by the prime numbers generated so far is checked. (29 is a prime number.. because it id not divisible by 2, 3, 5, 7, 11, 13, 17, 19 nor 23) We only need to verify divisibility against the numbers smaller than or equal to the root of the number in hand. (We needn't check the divisibility of 33 with 11, as we already must have found out it is divisible by 3).. I did not want to go with the mathematical root evaluation as i am not sure about its load. I used bits handling instead. the root of a number uses at most half of the number of bits that the original number uses. i only made a naive java implementation so far. downloa
Read more

Stress Testing with Siege and Bombard, know your limits

Image
I couldn't find a clear quick intro on getting siege and bombard in action, so I'm writing one here. Siege is a load testing and benchmarking utility that has been available for quite a while, It allows you to hit your web application on a specific url (or a set of urls in a file) with specific concurrency and size settings.  siege summarizes the measures of the test outcome including: Transaction rate (requests/sec) Actual concurrency (even if you hit with 200 concurrent connections, your server might be responding with just 80) Average, longest and shortest response time example: triggering 200 concurrent users, each hitting the url twice siege -c200 -r2 http://www.modsaid.com/ summary: Transactions:         400 hits Availability:      100.00 % Elapsed time:       38.44 secs Data transferred:        0.26 MB Response time:       10.09 secs Transaction rate:       10.41 trans/sec Throughput:        0.01 MB/sec Conc
Read more