Re: New Logic


"Spidey" <amalhashim@xxxxxxxxx> wrote in message
news:1133071695.210774.263050@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
> What is best solution for finding "a repeatedly occuring lenghtiest sub
> SEQUENCE from a given paragraph"
>
> ex:
> input:
> hello world is a good hello world. Is that the way it is
> a way.
> Output:
> hello world
>

It's reasonably difficult, as you're looking for n-gram frequency. So,
there's text chunking to do, and more than a little strtok'ing etc.

Have a look around some Computational Linguistics sites - hint: there are
tools on the web to do this (not neccessarily in C, or with source code
though)


.

Relevant Pages

  • Re: New Logic
    ... >> What is best solution for finding "a repeatedly occuring lenghtiest sub ... >> SEQUENCE from a given paragraph" ...
    (comp.lang.c)
  • New Logic
    ... What is best solution for finding "a repeatedly occuring lenghtiest sub ... SEQUENCE from a given paragraph" ... Prev by Date: ...
    (comp.lang.c)
  • Re: New Logic
    ... > What is best solution for finding "a repeatedly occuring lenghtiest sub ... > SEQUENCE from a given paragraph" ... It's a programming problem rather than a C program. ...
    (comp.lang.c)
  • Re: Figure numbering sequece is malfunctioning.
    ... > Turning off Track Changes resolved the sequence problems. ... >>>Suzanne S. Barnhill ... >>>Microsoft MVP ... >>>> document doesn't fix the problem - the pasted paragraph ...
    (microsoft.public.word.numbering)
  • Re: Lennys Counter Argument
    ... have a specific paragraph of 1000 specifically arranged characters. ... dependent up the specific arrangement of all the characters in the ... subsequence matches in the EB, the average sequence match size would ...
    (talk.origins)