-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 02/04/2011 03:50 AM, T. R. Valentine wrote:
> But in a language with homophones, homographs, heteronyms, and heterographs, > I can't even begin to imagine how one could code for all the possibilities ( First you check for word order. Then you check for word pair frequency. - From a practical point of view, the biggest hurdle is constructing the database to be used for checking the word order. Constructing the expert system to validate the grammar is fairly straightforward. Time consuming, but doable. - From a legal point of view, the issue is patents. Thousands of them. Most of which are obvious, and nothing more than "use a computer to detect if these words are sequential, or not." jonathon -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQEcBAEBAgAGBQJNS9yTAAoJEERA7YuLpVrVOdQH/jZpcuigfSfBq+3Yd8nB6pmw Nbk3aCaTMN2QYy9RcT/HRMZWcwiwgGmpmrhKLc6M2LAWT8sWMIyn3vPOAmku6Cso ZaaS0f2VJ+HIBb5TKQTX9RVY4qsym0Hnf8++xdJErIouDYNnVjuwWaWyaN0x03o7 hdBZrTO3uM8RnzocqSSTqPx8nayU3wykfyaLiiRXebu20e+wCoYN6mp2+nZfIc3+ tjFDIP8/YJ2kktDd27Y58leZBkjyD9OEa0wWGp4a0V1phudLCpjItEHXcHcFLAXG MCwklnrtMFmX1I3zL9KCAQbV2ps8VINx+pWztaBQLmr5u4P7Y+Pc33b+u/CE214= =bwQC -----END PGP SIGNATURE----- -- Unsubscribe instructions: E-mail to [email protected] List archive: http://listarchives.libreoffice.org/www/users/ *** All posts to this list are publicly archived for eternity ***
