Phone number to words

[Jordi Bunster]

Does anyone have one of those algorithms that convert a phone number to
a word, using /usr/share/dict/words, for example?

In Ruby, I mean.

 

[Bill Guindon]

Sounds like it would make a good ruby quiz, and Friday's coming.

 

[Joe Van Dyk]

Sounds like it would make a good ruby quiz, and Friday's coming.

Heck yeah, that would be a great one. I'd actually do it.

 

[Szymon Drejewicz]

Does anyone have one of those algorithms that convert a phone number to
a word, using /usr/share/dict/words, for example?

In Ruby, I mean.

Do you mean something like:

Speaker.say('888 999 123')
=> eight eight eight nine nine nine one two three

?

 

[Bertram Scharpf]

Hi,

Am Donnerstag, 10. Feb 2005, 09:26:39 +0900 schrieb Bill Guindon:

Sounds like it would make a good ruby quiz, and Friday's coming.

words = %w(zero one two ...)
number.scan( /[0-9]/).map { |x| words[ x.to_i] }.join ' '

A nice quiz would be saying numbers in French.

Bertram

 

[David A. Black]

Hi --

Hi,

Am Donnerstag, 10. Feb 2005, 09:26:39 +0900 schrieb Bill Guindon:

Sounds like it would make a good ruby quiz, and Friday's coming.

words = %w(zero one two ...)
number.scan( /[0-9]/).map { |x| words[ x.to_i] }.join ' '

I don't think that's what Jordi meant. I think it's more like:
convert the numbers to their letter equivalents (2 => a,b,c; 3 =>
d,e,f; etc. [in the U.S.]), and then see what words you can spell.

Just for fun, though, here's another way to do yours:

require 'scanf'
number.scanf("%1d") {|n,| words[n] }.join(" ")


David

 

[Tom Rathbone]

Sounds like it would make a good ruby quiz, and Friday's coming.

I recently wrote a challenge/quiz for www.osix.net (a nice little
challenge site.. good place to strut your ruby) it hasn't been
released yet but will be shortly. The challenge to to decode a string
of telephone keypresses to words as if composing a message using
predictive-text (T9). Is this what you meant? If so could I ask that
it is held off as a ruby quiz until our challenge has run its course
and the prize winners are announced, release is any day now, runs for
one month.

Tom.

P.S I wrote the original converted in Ruby.. very easy.

 

[Jordi Bunster]

I don't think that's what Jordi meant. I think it's more like:
convert the numbers to their letter equivalents (2 => a,b,c; 3 =>
d,e,f; etc. [in the U.S.]), and then see what words you can spell.

Exactly. 1-800-SUETHEM and the like.

 

[Gavin Kistner]

[...] The challenge to to decode a string
of telephone keypresses to words as if composing a message using
predictive-text (T9). Is this what you meant?

No, I believe the OP was just looking for "what fun and memorable
phrase can I tell people to use for my phone number?", not T9.

 

[James Edward Gray II]

Heck yeah, that would be a great one. I'd actually do it.

You guys know how this system works by now, don't you? It somebody
puts a write-up I can use in my inbox, I promise, it'll happen.

I'm currently empty on submitted quizzes too, so the more ideas the
better. Send it in.

James Edward Gray II

 

[Austin Ziegler]

** I've just had a sudden doubt that T9 has a standardised number to
letter map...

Yes. Q is on 7 and Z is on 9. Beyond that, it's the standard telephone key map.

-austin

 

[Bertram Scharpf]

Hi,

Am Donnerstag, 10. Feb 2005, 21:42:47 +0900 schrieb Jordi Bunster:

I don't think that's what Jordi meant. I think it's more like:
convert the numbers to their letter equivalents (2 => a,b,c; 3 =>
d,e,f; etc. [in the U.S.]), and then see what words you can spell.

Exactly. 1-800-SUETHEM and the like.

Seems to be no real challenge either.
<http://projects.bertram-scharpf.de/tmp/phonetoword.rb>

What happens to the 0 and 1 digits?

Bertram