strings as inputs to a function

[David W. Thorell]

I am trying to write a basic spell check function, one which has as
its parameters two strings arrays, one is an article from a file
source which needs to be checked for valid words, in this case the
word needs to be at least 2 characters long with no intervening
punctuation, numbers or other non-letters.
This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article. All of this needs to be done with
few or no pointers.
Any suggestions out there?

[Artie Gold]

David W. Thorell wrote:

I am trying to write a basic spell check function, one which has as
its parameters two strings arrays, one is an article from a file
source which needs to be checked for valid words, in this case the
word needs to be at least 2 characters long with no intervening
punctuation, numbers or other non-letters.
This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article. All of this needs to be done with
few or no pointers.
Why?
Any suggestions out there?

Some functions you'll need are tolower(), fgets(), strcmp(), printf().
Try to write the code (it's pretty simple) and repost if you run into
problems.

HTH,
--ag

[David Rubin]

"David W. Thorell" wrote:

[snip]

This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article. All of this needs to be done with
few or no pointers.
Any suggestions out there?

Use a hash table.

Also, what is your definition of "few" pointers? And do you have a plan
for prefixed and suffixed words (un-, re-, -s, -ing, -ed, etc)?

/david

--
Andre, a simple peasant, had only one thing on his mind as he crept
along the East wall: 'Andre, creep... Andre, creep... Andre, creep.'
-- unknown

[Malcolm]

"David W. Thorell" <dt******@hotma il.com> wrote in message

I am trying to write a basic spell check function, one which has as
its parameters two strings arrays, one is an article from a file
source which needs to be checked for valid words, in this case the
word needs to be at least 2 characters long with no intervening
punctuation, numbers or other non-letters.
This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article. All of this needs to be done with
few or no pointers.
Any suggestions out there?

I don't understand the "few or no pointers" restriction. The C language is
built around pointers (in C++ there is a move to get away from using
pointers and towards higher-level substitutes, but this is comp.lang.c).

You need a function

int spellcheck(char **dictionary, int N, char *word)

Assume the dictionary contains all allowed words in alphabetical order.

The lazy way is simply to step right through the array using strcmp(). If
you find a match, return 1, if you get to the end, return 0.

However we can speed things up a lot by doing a binary search. You maintain
three numbers, low, high, and middle. At the beginning low is the first word
in the dictionary, high is the last word, and middle is the middle word. Say
your word is alphabetically after middle. Then low becomes middle, high
stays the same, and middle becomes the new mid point, that is, the three
quarters mark.
You repeat this technique until either you find a match or low and high
converge to the same value, in which case you know the word isn't in the
dictionary.

[pete]

David Rubin wrote:

Malcolm wrote:

[snip]

Assume the dictionary contains
all allowed words in alphabetical order.

The lazy way is simply to step right
through the array using strcmp().
If you find a match, return 1, if you get to the end, return 0.

However we can speed things up a lot by doing a binary search.
You maintain

[snip - how to do a binary search]

Or you use bsearch (stdlib.h).

bsearch, requires an array of objects.
I'm thinking that the dictionary is more like a sequence of strings.

--
pete

[Richard Heathfield]

pete wrote:

David Rubin wrote:

<snip>
Or you use bsearch (stdlib.h).

bsearch, requires an array of objects.
I'm thinking that the dictionary is more like a sequence of strings.

<shrug> array of char *

#include <string.h>

int compare(const void *vs1, const void *vs2)
{
char * const * s1 = vs1;
char * const * s2 = vs2;
return strcmp(*s1, *s2);
}

--
Richard Heathfield : bi****@eton.pow ernet.co.uk
CLINT v1.0b - now with stretchy strings!

[pete]

Richard Heathfield wrote:

pete wrote:

David Rubin wrote:

<snip>
Or you use bsearch (stdlib.h).

bsearch, requires an array of objects.
I'm thinking that the dictionary is more like a sequence of strings.

<shrug> array of char *

#include <string.h>

int compare(const void *vs1, const void *vs2)
{
char * const * s1 = vs1;
char * const * s2 = vs2;
return strcmp(*s1, *s2);
}

What value are you going to give to the "size" parameter
when you call bsearch?

void *bsearch(const void *key, const void *base,
size_t nmemb, size_t size,
int (*compar)(const void *, const void *));

--
pete

[Richard Heathfield]

pete wrote:

Richard Heathfield wrote:

pete wrote:

> David Rubin wrote:
>>

<snip>

>>
>> Or you use bsearch (stdlib.h).
>
> bsearch, requires an array of objects.
> I'm thinking that the dictionary is more like a sequence of strings.

<shrug> array of char *

#include <string.h>

int compare(const void *vs1, const void *vs2)
{
char * const * s1 = vs1;
char * const * s2 = vs2;
return strcmp(*s1, *s2);
}

What value are you going to give to the "size" parameter
when you call bsearch?

void *bsearch(const void *key, const void *base,
size_t nmemb, size_t size,
int (*compar)(const void *, const void *));

Here, have a complete, compiled, tested program:

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

int compare(const void *vs1, const void *vs2)
{
char * const * s1 = vs1;
char * const * s2 = vs2;
return strcmp(*s1, *s2);
}

int main(void)
{
char *array[] =
{
"now", "is", "the", "time", "for", "all",
"good", "men", "to", "go", "to", "the", "party"
};
char *key = "party";
char **result = NULL;

qsort(array,
sizeof array / sizeof array[0],
sizeof array[0],
compare);

result = bsearch(&key,
array,
sizeof array / sizeof array[0],
sizeof array[0],
compare);

if(result != NULL)
{
printf("%s\n", *result);
}
return 0;
}
--
Richard Heathfield : bi****@eton.pow ernet.co.uk
http://www.rjgh.co.uk - stretchy string support
in CLINT v1.0b - the library with no name.

[pete]

Richard Heathfield wrote:

Here, have a complete, compiled, tested program: int main(void)
{
char *array[] =
{
"now", "is", "the", "time", "for", "all",
"good", "men", "to", "go", "to", "the", "party"
};

It's too pointy.

"I am trying to write a basic spell check function, one which has as
its parameters two strings arrays, one is an article from a file
source which needs to be checked for valid words, in this case the
word needs to be at least 2 characters long with no intervening
punctuation, numbers or other non-letters.
This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article. All of this needs to be done with
few or no pointers."

The impresion that I get, is that the input file and the dictionary
are both just supposed to be text files, not arrays of pointers.

--
pete

[pete]

pete wrote:

Richard Heathfield wrote:

Here, have a complete, compiled, tested program:

int main(void)
{
char *array[] =
{
"now", "is", "the", "time", "for", "all",
"good", "men", "to", "go", "to", "the", "party"
};

It's too pointy.

"I am trying to write a basic spell check function, one which has as
its parameters two strings arrays, one is an article from a file
source which needs to be checked for valid words, in this case the
word needs to be at least 2 characters long with no intervening
punctuation, numbers or other non-letters.
This word then needs to be lower case and then compared to the
dictionary input array. the end result being the printing out of all
the misspelled words in the article.
All of this needs to be done with few or no pointers."

The impresion that I get, is that the input file and the dictionary
are both just supposed to be text files, not arrays of pointers.

/* BEGIN spell.c */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

#define DICTIONARY "now is the time for all good men "\
"to come to the aid of the party"
#define TEXT "Party pooka Aid Two"

void spell_check(cha r *, char *);

int main(void)
{
char *dictionary;
char *key;

dictionary = DICTIONARY;
key = TEXT;
spell_check(key , dictionary);
return 0;
}

void spell_check(cha r *key, char* dictionary)
{
char *copy;
size_t k_byte;
size_t k_size;
size_t length;

k_size = 1 + strlen(key);
copy = malloc(k_size);
if (!copy) {
fputs("Forget about it\n", stderr);
exit(EXIT_FAILU RE);
}
for (k_byte = 0; key[k_byte]; ++k_byte) {
copy[k_byte] = (char)(isalpha( key[k_byte])
? tolower(key[k_byte]) : '\0');
}
copy[k_byte] = '\0';
for (k_byte = 0; k_size; k_size -= length) {
if (!strstr(dictio nary, copy + k_byte)) {
puts(copy + k_byte);
}
length = strlen(copy + k_byte) + 1;
k_byte += length;
}
free(copy);
}

/* END spell.c */

--
pete