1995 entries checked

Fixed formatting of README.md files.

Some typo fixes.

All entries work well.

Added some try commands.
This commit is contained in:
Cody Boone Ferguson committed 2023-03-18 10:03:51 -07:00
1 parent be60ae60ed
commit fa2a763f6c
13 files changed
+455 -396

No files matched your search

+37 -35
View File
@@ -9,56 +9,58 @@
make all
### To run
### To run:
./esde data-file word
where data-file contains lines of < 255 chars in length.
where data-file contains lines of < 255 chars in length.
## Judges' comments
Try:
## Try:
./esde esde.data Johanson
./esde esde.data2 read
./esde esde.hint date
./esde README.md date
When reading the source be careful to distinguish between variable
names and library functions.
If you still don't know what it does, try:
http://avian.dars.muohio.edu/~kaelbesa/soundex.html
http://avian.dars.muohio.edu/~kaelbesa/coder.html
## Judges' comments:
When reading the source be careful to distinguish between variable
names and library functions.
If you still don't know what it does, try
[https://en.wikipedia.org/wiki/Soundex](https://en.wikipedia.org/wiki/Soundex).
## Author's comments
0) what this program does.
This program searches in the file words which have the same Soundex code
like the given word, and print out lines with these words.
### what this program does:
The Soundex code is using to find similar sounds words.
This program searches in the file words which have the same Soundex code
like the given word, and print out lines with these words.
Soundex code begins with the first letter of the word followed by a
three-digit code. There is the algorithm:
The Soundex code is using to find similar sounds words.
a) Every letter in the word change by a digit (excluding the first
letter).
b) Replace all pairs of the same code by single code
(ex. R011235 -> R01235).
c) Remove all 0-codes (ex. R01235 -> R1235).
d) If lenght of code is > 4, get only first 4 codes (ex. R1235 -> R123).
e) If lenght of code is < 4, add zeros (ex. T12 -> T120).
Soundex code begins with the first letter of the word followed by a
three-digit code. There is the algorithm:
There is the codes:
0 = A, E, H, I, O, U, W, Y
1 = B, P, F, V
2 = C, S, G, J, K, Q, X, Z
3 = D, T
4 = L
5 = M, N
6 = R
0. Every letter in the word change by a digit (excluding the first letter).
1. Replace all pairs of the same code by single code (ex. R011235 -> R01235).
2. Remove all 0-codes (ex. R01235 -> R1235).
3. If length of code is > 4, get only first 4 codes (ex. R1235 -> R123).
4. If length of code is < 4, add zeros (ex. T12 -> T120).
1) information about an info file.
An info file should be a text file consisting of lines (max. 256 bytes
in each line).
These are the codes:
0 = A, E, H, I, O, U, W, Y
1 = B, P, F, V
2 = C, S, G, J, K, Q, X, Z
3 = D, T
4 = L
5 = M, N
6 = R
### information about an info file:
An info file should be a text file consisting of lines of text (max. 256 bytes
in each line).