Announcement

Collapse
No announcement yet.

Spelling Checker

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • Spelling Checker

    I am trying to find a spelling checker to use from within a PB program.

    Essentially I want to say "Is word 'xxx' spelled correctly?" and be told yes or no.

    In fact, when I think about it, what I really want to know is "Does word 'xxx' exist or not?" Which really amounts to the same thing I suppose.

    It is part of developing a word puzzle so it would be nice but not critical if it was quite quick. And again, nice but not critical, if I could choose US or UK spelling. I am only interested in English - at this stage anyway.

    The checker would need to have all forms of the word in but should differentiate between plurals and singular forms. I would not want to get a positive response for proper nouns.

    And ideally, it would be nice to be able to quote what authority I had for the answers.

    Any suggestions on where I should investigate?

    Thanks
    [I]I made a coding error once - but fortunately I fixed it before anyone noticed[/I]
    Kerry Farmer

  • #2
    Originally posted by kerry Farmer View Post

    The checker would need to have all forms of the word in but should differentiate between plurals and singular forms. I would not want to get a positive response for proper nouns.

    And ideally, it would be nice to be able to quote what authority I had for the answers.

    Any suggestions on where I should investigate?

    Thanks
    There are some free dictionary files that you can download and roll your own check against one or more of these files.

    This site list some free spell checkers.

    Comment


    • #3


      Peter Redei

      Comment


      • #4
        Depending on what word puzzle you are creating, you might want to take CONTEXT into consideration.

        Break - Brake
        Disc - Disk

        Both are spelled correctly if inserted in proper context but not spelled correctly if taken out of context.

        There are no atheists in a fox hole or the morning of a math test.
        If my flag offends you, I'll help you pack.

        Comment


        • #5
          I'm pretty sure I downloaded a DLL called PBSpell a long time ago. I can't remember where I got it but it looked to be okay.

          The only thing I found doing a google search is some Phoenix forum messages that mention using PBSpell as a sample for how to include you own DECLAREs in a project.
          Jeff Blakeney

          Comment


          • #6
            Kerry,

            A while back John G and I worked a "Word Connection" puzzle solver using a file of 100k+ words. It found all possible connections between two words in 10ths of a second. You may find it useful to see how it was done using an ascii hash total for each word.


            '
            ' The files are here:



            Also have a multi featured utility program I use frequently (several times a day) that checks spelling by checking the word in the clipboard using the same word file. It finds all spelling variations of a word instantly (effectively).

            ' The files are here:
            http://www.SwedesDock.com/powerbasic/Z-Post.exe (note - Spell check and some other routines will not run w/o associated files but you can see format. Click through several error mags until getting to z-post main screen.)



            (The bas & exe are current but the zip is not but relevant files other than those two are).
            ======================================
            Politics, n.
            Interests masquerading as principles.
            Ambrose Bierce (1842-1914)
            ======================================
            Last edited by Gösta H. Lovgren-2; 12 Sep 2009, 08:47 PM.
            It's a pretty day. I hope you enjoy it.

            Gösta

            JWAM: (Quit Smoking): http://www.SwedesDock.com/smoking
            LDN - A Miracle Drug: http://www.SwedesDock.com/LDN/

            Comment


            • #7
              I did something much more gruesome for Textris, an old game I wrote that was a combination of Tetris and Scrabble. If I recall correctly, for the dictionary, I used the first 2-3 characters directly as array indices, which made a pointer to the first entry in the matching list. Any following words were checked, one by one, to see if they also matched.

              Very crude, but fast enough, and it was sufficient.

              There are more than a few versions of Textris out there, these days. Some of them derive from my work, in one way or another... if you like word games, Google.

              Comment


              • #8
                Thank you everybody

                Lots to investigate - lots to think about

                Great
                [I]I made a coding error once - but fortunately I fixed it before anyone noticed[/I]
                Kerry Farmer

                Comment


                • #9
                  the File Range Trie DB is a Key/Value, String/String database
                  it is capable of finding 100,000 string Keys in 0.01599 seconds
                  you would have to add the dictionary words
                  there are dictionary list around
                  stanthemanstan~gmail
                  Dead Theory Walking
                  Range Trie Tree
                  HLib ~ Free Data Container Lib ~ Arrays, Lists, Stacks, Queues, Deques, Trees, Hashes

                  Comment


                  • #10
                    Originally posted by Tom Hanlin View Post
                    I did something much more gruesome for Textris, an old game I wrote that was a combination of Tetris and Scrabble.
                    Slight hijack, but as to Textris...



                    Originally posted by Game Review (written by Alfy30) Added on: 04/17/2008
                    Textris will always be one of the greatest video games ever developed. Not only is it a addicting game but also can be mind challenging for all ages.

                    Comment

                    Working...
                    X