The similarity is described by the minimum number of letters you have to add, remove or replace in order to get from the entered word to one of the dictionary.

Mathematically, this is a well-defined measure with no ambiguity. minimum is the keyword here - it does not matter which changes you make to go from one string to the other, as long as you do as few as possible. This problem is well-known and there are existing algorithms to solve it that you can readily find online.

Railfence has a limit by defniniton of how many letters there are, but the way you design your solution should not matter...

no limit

really enjoyed this, even though it took me days to solve....something great (And useful) to wrap your head around.

Looking at some of the other solutions tho....

Beat the challenge quite quickly, then you declared the thing as a 2D in a Jagged format! took me an hour to work out the most efficient way of getting the length of each row/column using that method.

Good way of learning tho!
p.s. still don't see the point of having a constructor!

Boggle is not a method, it's a constructor of the class under test. I guess you are supposed to set up your solution in the constructor, and perform actual search in Check. I do not know if this design is really necessary for such task, but since it was authored like this, you need to stick to it.

C#

What language?

Yes, kata says that dot is 1 time unit long and dash is 3 time units long, but it does not say how many 1s are in single time unit: is it 1, or 11 or 111 or 1111. On the contrary, it explicitly says that time unit can differ between test cases:

However, the standard does not specify how long that "time unit" is. And in fact different operators would transmit at different speed.
Function [...] should find out the transmission rate of the message...

Your task is to find out, for every test case, how many 1s and 0s are in one time unit.

but in every other test case 1 or 2 11's would equate to a dot and 3 would equate to a dash, the Kata says "Dash" – is 3 time units long.

I've just seen this highlighed as an issue many times in the issues section. I need to build in some facility to determine time limit, but i'm now going to have to build a supplimental function.

There is also an issue with one of the tests in c#(TestLongMessagesHandling) as it works in my Vis Studio, but not on the codewars kata.

Transmission rate differs from test to test. In one test case E can be 11, and in another test case it can be 111. It's your task to find out what it is in given test case.

Also remember about this reuirement: "[...] if you have trouble discerning if the particular sequence of 1's is a dot or a dash, assume it's a dot."

How is 111 E? I thought only 11 was a dot? anything more than 11 was a dash?

i think a number of people have mentioned this, but as i code in an IDE the import it into codewars, I know you can access the dictionary using a little get method, but it would be good to have the 2D array so i can get it without having to type the whole thing out in the IDE which is a pain.

GOT IT! each one you have to stack up the previous URL.
e.g. profiles/
profiles/byskin
profiles/byskin/anotherpage

i've got the same issue.....http://linkedin.it/profiles/by-skin-at-from-for-surfer/secret-page.htm?favourite=code

why does both have to contain profiles. this is not a rule that was in the Kata