[QUOTE=science_man_88;229151]I've got the basics of math English down with this code though I'll make more list.[/QUOTE]

Good idea. I'm not sure my list is useful here -- these are complicated and hard-to-generalize examples. :redface:

[QUOTE=science_man_88;229151]if you look at it correcting typo is a task it would need to be AI complete.[/QUOTE]

I hope not... that looks doable in most cases to me, with some form of spell-check plus a trigram (?) prediction algorithm run across large bodies of text. Not an easy task, though!

[QUOTE=CRGreathouse;229155]Good idea. I'm not sure my list is useful here -- these are complicated and hard-to-generalize examples. :redface:



I hope not... that looks doable in most cases to me, with some form of spell-check plus a trigram (?) prediction algorithm run across large bodies of text. Not an easy task, though![/QUOTE]

I've been playing cards most of the day and thinking about this I think I could manage it and cut the memory cost down by using a form of FaR for spell check.

then find and replace (possibly with find and replace on the Vec to capture multiple forms of the same thing (not quite sure how to do this though)).

saves on building new scripts as well if we could do it this way.

in fact FaR could be used in:

1) encoding and decoding shi*t(* is wild card but can be f or no character in this case) ciphers

2)Find and Replace

3)Find and replace of spelling errors.

and many other ways I suspect.

[QUOTE=science_man_88;229193]in fact FaR could be used in:

1) encoding and decoding shi*t(* is wild card but can be f or no character in this case) ciphers

2)Find and Replace

3)Find and replace of spelling errors.

and many other ways I suspect.[/QUOTE]

Yes, it's quite a general function. More general yet (but harder!) would be a regular expression engine.

[QUOTE=CRGreathouse;229204]Yes, it's quite a general function. More general yet (but harder!) would be a regular expression engine.[/QUOTE]

2 and 3 are things we'd likely want in the polished version.

spell check then pass to a math based FaR .

we could put it in a file to spell check with a already built spell checker program (though this sounds harder than another FaR based script) then read it into FaR
also I think I need one more thing in FaR as if I realized correct it only works fully when your phrase ends with what you're searching for.

[QUOTE=CRGreathouse;229204]Yes, it's quite a general function. More general yet (but harder!) would be a regular expression engine.[/QUOTE]

yeah the hard part from my script I see is the original things to look for.

[QUOTE=CRGreathouse;229155]trigram (?)[/QUOTE]

[url]http://en.wikipedia.org/wiki/Trigram[/url]

[QUOTE=science_man_88;229206]spell check then pass to a math based FaR .

we could put it in a file to spell check with a already built spell checker program (though this sounds harder than another FaR based script) then read it into FaR
also I think I need one more thing in FaR as if I realized correct it only works fully when your phrase ends with what you're searching for.[/QUOTE]

If you build a spell checker (whether based on your FaR script or not) that would be pretty cool -- maybe even science fair-worthy, if you're at a level that does that sort of thing.

[QUOTE=science_man_88;229217][url]http://en.wikipedia.org/wiki/Trigram[/url][/QUOTE]

Yes, I was talking about what that page calls word-level trigrams. See
[url]https://secure.wikimedia.org/wikipedia/en/wiki/N-gram#n-gram_models[/url]

now this is sounding complex lol.

[QUOTE=science_man_88;229229]now this is sounding complex lol.[/QUOTE]

Yes, it *is* rather complex. But it's easier than the final project, and should be good practice. Also, you [i]could do it[/i] -- not that it would be easy, but with how far you've come I have no doubt.