Program that makes a list of words.

[lundslaktare]

Maybe this is the wrong group, if so I would like to be pointed
to a better group.
Anyway here's the problem:

I would need a program that makes a list of words of a text-file.

For example take the text:

------------------------------------
To be, or not to be; thats: the ques-
tion.
-----------------------------------------

would return:

be 2
not 1
or 1
question 1
thats 1
the 1
To 1
to 1
.. 1
, 1
: 1
; 1
- 1
As can be seen from this example, I want the program to count both
words and
interpunctation, and I want it to make a difference between "to" and
"To",
I also want it to count:

ques
-tion

as

question 1
- 1
Any help would be appreciated!

[Chris McDonald]

lu**********@yahoo.com writes:

>Any help would be appreciated!

The result you seek (homework?) is typically termed a concordance.

--
Chris.

[lundslaktare]

Chris McDonald skrev:

lu**********@yahoo.com writes:

Any help would be appreciated!

The result you seek (homework?) is typically termed a concordance.

--
Chris.

Thank you for helping me.
Now I know what's the name is: concordance.
I guess that's some kind of dance?

It's not homework, I'm not a computerscientist.

I really would appreciate if someone can give me the URL
where I can find such a program.

[Chris McDonald]

lu**********@yahoo.com writes:

>Thank you for helping me.
Now I know what's the name is: concordance.
I guess that's some kind of dance?

>It's not homework, I'm not a computerscientist.

>I really would appreciate if someone can give me the URL
where I can find such a program.

Here's a start:

http://www.google.com/search?client=...UTF-8&oe=UTF-8

--
Chris.

[viza]

Hi

On May 13, 9:52 am, Richard Heathfield <[e-mail]:

[e-mail] said:

I asked my Father, and he suggested that I should use microsoft-word
to make the whole text one column,
and then insert that column in excel and use the sorting
function.

Blech! :-)

But that wont work for long text(more than 65536 words).

And it's so inelegant, too.

[snip]

>
qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list. I bet even excel doesn't use qsort. Perhaps a
good one would use a tree?

[Joachim Schmitz]

viza wrote:

Hi

On May 13, 9:52 am, Richard Heathfield <[e-mail]:

>[e-mail] said:

>>I asked my Father, and he suggested that I should use microsoft-word
to make the whole text one column,
and then insert that column in excel and use the sorting
function.

Blech! :-)

>>But that wont work for long text(more than 65536 words).

And it's so inelegant, too.

[snip]

>>
qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list. I bet even excel doesn't use qsort. Perhaps a
good one would use a tree?

Who says that qsort does not do an insert sort? qsort != quick sort, at
least not neccarrily, regardless what the name implies

Bye, Jojo

[pete]

Joachim Schmitz wrote:

viza wrote:

>Hi

On May 13, 9:52 am, Richard Heathfield <[e-mail]:

>>[e-mail] said:
I asked my Father, and he suggested that I should use microsoft-word
to make the whole text one column,
and then insert that column in excel and use the sorting
function.
Blech! :-)

But that wont work for long text(more than 65536 words).
And it's so inelegant, too.

[snip]

>> WordArray

>> sizeof *WordArray

>pot? kettle? :-)

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list. I bet even excel doesn't use qsort. Perhaps a
good one would use a tree?

Who says that qsort does not do an insert sort? qsort != quick sort, at
least not neccarrily, regardless what the name implies

What linked list?

--
pete

[Richard Heathfield]

viza said:

<snip>

>>
qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

I don't follow. I grabbed something off the Net and hacked it a bit to give
the OP a rough idea. I neither wrote the original code nor intended to
provide a perfect solution.

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list.

I'd have used a BST, personally. But I didn't rush this implementation. I
stole it.

--
Richard Heathfield <http://www.cpax.org.uk>
Email: -http://www. +rjh@
Google users: <http://www.cpax.org.uk/prg/writings/googly.php>
"Usenet is a strange place" - dmr 29 July 1999

[CBFalconer]

lu**********@yahoo.com wrote:

Chris McDonald skrev:

>lu**********@yahoo.com writes:

>>Any help would be appreciated!

The result you seek (homework?) is typically termed a concordance.

Thank you for helping me. Now I know what's the name is:
concordance. I guess that's some kind of dance?

It's not homework, I'm not a computerscientist.

I really would appreciate if someone can give me the URL
where I can find such a program.

Try wdfreq.c, a demo program with the hashlib package. It should
be easily modifiable to do what you wish. See:

<http://cbfalconer.home.att.net/download/hashlib.zip>

--
[mail]: Chuck F (cbfalconer at maineline dot net)
[page]: <http://cbfalconer.home.att.net>
Try the download section.
** Posted from http://www.teranews.com **

[Keith Thompson]

viza <to******@gmail.comwrites:

On May 13, 9:52 am, Richard Heathfield <[e-mail]:

>[e-mail] said:

I asked my Father, and he suggested that I should use microsoft-word
to make the whole text one column,
and then insert that column in excel and use the sorting
function.

Blech! :-)

But that wont work for long text(more than 65536 words).

And it's so inelegant, too.

[snip]

>>
qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list. I bet even excel doesn't use qsort. Perhaps a
good one would use a tree?

Why would you expect insertion sort (O(N**2)) to be better than qsort
(unspecified, but likely to be O(N log N))?

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
Nokia
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"

[viza]

Hi

On May 13, 12:55 pm, "Joachim Schmitz" <nospam.j...@schmitz-
digital.dewrote:

viza wrote:

On May 13, 9:52 am, Richard Heathfield <[e-mail]:

[e-mail] said:

And it's so inelegant, too.

[snip]

qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

Even the most rushed semi-efficient implementation would use an insert
sort on a linked list. I bet even excel doesn't use qsort. Perhaps a
good one would use a tree?

Who says that qsort does not do an insert sort? qsort != quick sort, at
least not neccarrily, regardless what the name implies

It could perhaps, but qsort always requires all of the items to be in
place before it starts, so solving this problem with a qsort that was
implemented as an insert sort would double peak memory usage, and have
to copy the whole thing back as well. In this case IMHO it makes
sense to sort it as it is read, and the easiest way that I could think
to do this was an insert sort into a list.

Regards,
viza

[viza]

Hi

On May 13, 1:22 pm, Richard Heathfield <[e-mail]:

viza said:

qsort(WordArray, Treecount, sizeof *WordArray, CompareWords);

pot? kettle? :-)

I don't follow. I grabbed something off the Net and hacked it a bit to give
the OP a rough idea. I neither wrote the original code nor intended to
provide a perfect solution.

I realized that, it was good of you to help the (OT) OP. I just
thought that the method this code used wasn't very elegant either.

Regards,
viza

[CBFalconer]

viza wrote:

>

.... snip ...

>
Even the most rushed semi-efficient implementation would use an
insert sort on a linked list. I bet even excel doesn't use qsort.
Perhaps a good one would use a tree?

If you have a linked list, the most efficient sort is almost
certainly mergesort. It can operate in place, is O(NlogN), etc.
Virtually no extra memory is required.

--
[mail]: Chuck F (cbfalconer at maineline dot net)
[page]: <http://cbfalconer.home.att.net>
Try the download section.
** Posted from http://www.teranews.com **