[#389739] Ruby Challenge — teresa nuagen <unguyen90@...>

Here is a ruby challenge for all you computer science lovers out there,

22 messages 2011/11/05
[#389769] Re: Ruby Challenge — "Jonan S." <jonanscheffler@...> 2011/11/05

Totally unrelated to any husker computer science programs right? Like

[#389905] Re: Ruby Challenge — Stephen Ramsay <sramsay.unl@...> 2011/11/09

Jonan S. wrote in post #1030330:

[#389907] Re: Ruby Challenge — aseret nuagen <unguyen90@...> 2011/11/09

> You mean like the professor for the course? Because that would be me .

[#389915] Re: Ruby Challenge — Robert Klemme <shortcutter@...> 2011/11/09

On Wed, Nov 9, 2011 at 4:52 AM, aseret nuagen <unguyen90@aim.com> wrote:

[#389792] Tricky DSL, how to do it? — Intransition <transfire@...>

I'd want to write a DSL such that a surface method_missing catches

18 messages 2011/11/06

[#389858] Compiling Ruby Inline C code - resolving errors — Martin Hansen <mail@...>

I am trying to get this Ruby inline C code http://pastie.org/2825882 to

12 messages 2011/11/08

[#389928] Forming a Ruby meetup group... — "Darryl L. Pierce" <mcpierce@...>

Where I work we have a local Ruby group that used to meet up, until the

12 messages 2011/11/09

[#389950] The faster way to read files — "Noé Alejandro" <casanejo@...>

Does anybody know which is the fastest way to read a file? Lets say

18 messages 2011/11/09

[#390064] referring to version numbers in a gem — Chad Perrin <code@...>

How do I specify and access a gem's version number within the code of the

28 messages 2011/11/11

[#390238] RVM problem, plz help — Misha Ognev <b1368810@...>

Hi, I have this problem:

15 messages 2011/11/16

[#390308] any command line tools for querying yaml files — Rahul Kumar <sentinel1879@...>

(Sorry, this is not exactly a ruby question).

11 messages 2011/11/18

[#390338] Newbie - cmd question — Otto Dydakt <ottodydakt@...>

I've literally JUST downloaded ruby from rubyinstaller.org.

21 messages 2011/11/19
[#390342] Re: Newbie - cmd question — Otto Dydakt <ottodydakt@...> 2011/11/19

OK thank you, I uninstalled & reinstalled, checking the three boxes at

[#390343] Re: Newbie - cmd question — "Ian M. Asaff" <ian.asaff@...> 2011/11/19

did you type "irb" first to bring up the ruby command prompt?

[#391154] Re: Newbie - cmd question — "Hussain A." <hahmad@...> 2011/12/12

Hi all,

[#391165] Re: Newbie - cmd question — Luis Lavena <luislavena@...> 2011/12/12

Hussain A. wrote in post #1036281:

[#390374] Principle of Best Principles — Intransition <transfire@...>

I seem to run into a couple of design issue a lot and I never know what is

16 messages 2011/11/20

[#390396] how to call Function argument into another ruby script. — hari mahesh <harismahesh@...>

Consider I have a ruby file called library.rb.

10 messages 2011/11/21

[#390496] How to make 1.9.2 my default version using RVM — Fily Salas <fs_tigre@...>

Hi,

25 messages 2011/11/24

[#390535] Is high-speed sorting impossible with Ruby? — "Gaurav C." <chande.gaurav@...>

Well, first of all, I'm new to Ruby, and to this forum. So, hello. :)

39 messages 2011/11/25
[#390580] Re: Is high-speed sorting impossible with Ruby? — Joao Pedrosa <joaopedrosa@...> 2011/11/27

Hi,

[#390593] Re: Is high-speed sorting impossible with Ruby? — "Gaurav C." <chande.gaurav@...> 2011/11/27

Joao Pedrosa wrote in post #1033884:

[#390600] Re: Is high-speed sorting impossible with Ruby? — Douglas Seifert <doug@...> 2011/11/27

A big gain can be had by disabling the garbage collector. Here is my best

[#390601] Re: Is high-speed sorting impossible with Ruby? — Douglas Seifert <doug@...> 2011/11/27

I've thrown various solutions up on github here:

[#390689] Stupid question — James Gallagher <lollyproductions@...>

Hi everyone.

22 messages 2011/11/30

Re: "A" and "an" articles in front of words

From: steve ross <cwdinfo@...>
Date: 2011-11-09 17:36:13 UTC
List: ruby-talk #389953
A complete dictionary shouldn't be necessary. Just exceptions. Look at how Rails handles pluralization. You can use the algorithm:

- if work starts with consonent, use "a"
- if word matches entry in exception list, use designated article
- else use "an" if it's a for-certain vowel ['a', 'e', 'i', 'o', 'u']

This way, you only do a lookup for words starting with possible vowels ['a', 'e', 'i', 'o', 'u', 'y', 'h']

You might even extend the consonant searching algorithm to use some heuristics as suggested the email below:

'a' if word =~ /^[-aieouyh]/ || word =~ /^u[-aieouyh] || word =~ /^y[-aieouyh]/

The problem is that the choice between 'a' and 'an' has to do with the way the word *sounds* in a given English (i.e., American, British). It is unlikely you will capture all the cases with a dictionary, hence the suggestion that the algorithm use a set of commonly encountered exceptions, accepting the fact that it will be incomplete and sometimes a bit embarrassing -- but no more so that the pronunciation of words by my nav. system's text to speech :)


On Nov 9, 2011, at 5:10 AM, Gon軋lo C. Justino wrote:

> google hasn't helped: does anyone have or know of a "complete" list of
> english words ?
> 
> On 8 November 2011 17:20, Chad Perrin <code@apotheon.net> wrote:
> 
>> On Tue, Nov 08, 2011 at 05:23:31PM +0900, Gon軋lo C. Justino wrote:
>>> 
>>> does different pronunciation comes from the subsequent  letters ? i'm
>>> thinking uMBrella, uNCle, uRGengt, uNDer, uGLy, uPPer, uRGe but uNIcorn,
>>> eULogy (or is this "an eulogy"? now i'm confused)... i'm wondering if two
>>> consonants make it "an" and at least one vowel make in "a". Maybe I'm
>> just
>>> ramblingm, this sounds so un-rubyesque :S
>> 
>> You're right about unicorn and eulogy.  I'm interested in checking out
>> the correlation between second-and-third letters and vowels that become
>> consonants in pronunciation now, to see how strong a correlation that is.
>> I'm pretty sure there are exceptions to these perceived rules, though, in
>> any case.
>> 
>> It seems likely that, most often, you'd get the following results, where
>> V means "vowel" and C means "consonant".  Lower case letters are
>> literals.  In each case, two adjacent vowels are assumed to be
>> *different* vowels.
>> 
>>   uCC: treat as vowel
>>   uCV: treat as consonant
>>   VVC: treat as consonant
>>   yC: treat as vowel
>>   yV: treat as consonant
>> 
>> These are only my immediate impressions, so far.  Assuming for argument's
>> sake that they're correct for the general case, though, there would
>> almost certainly be exceptions for every one of these correlations, and
>> the question that arises then is whether the exceptions are rare enough
>> to warrant using these correlations as rules with a set of exceptions
>> used to override them, or numerous enough for it to make more sense to
>> just use an extensive dictionary to handle such matters.
>> 
>> If I get really bored, I may put together a really extensive dictionary
>> to cover this, then use it to determine the strength of such
>> correlations some day (or week or month), but not today.
>> 
>> --
>> Chad Perrin [ original content licensed OWL: http://owl.apotheon.org ]
>> 


In This Thread