GRAMMER CHECKER

• US 20090192787A1
• Filed: 10/07/2008
• Published: 07/30/2009
• Est. Priority Date: 10/08/2007
• Status: Abandoned Application

• Current Assignee: David Blum, Deborah, Adv. Gador
• Original Assignee: David Blum, Deborah Gador
• Inventors: Roon, Adam
• Application Number:
  US12/246,510
• Publication Number:
  US 20090192787A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/216 using statistical methods
• CPC Class Codes: G06F 40/253 Grammatical analysis; Style critique
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

A method for parsing a computerized text, the method including preparing a set of logical rules, using logical grammatical links, for parsing a text, using the logical rules to identify a part of speech of each word of text and all links between the words in the text, and labeling the links as grammatically correct links or grammatically incorrect links for correction, so as to parse substantially every word in the text.

Claims

1. A method for parsing a computerized text, the method comprising:

preparing a set of logical rules, using logical grammatical links, for parsing a text;

using said logical rules to identify a part of speech of each word of text and all links between said words in said text; and

labeling said links as grammatically correct links or grammatically incorrect links for correction, so as to parse substantially every word in the text.

2. The system according to claim 1, wherein said step of identifying all links includes building a constituent tree.

7. The method according to claim 1, further comprising linkage analysis for analyzing links between pairs of words in the text and determining whether meet said grammatical rules.

9. The method according to claim 7, further comprising sentence structure analysis for analyzing structure of the text according to said grammatical rules.

3. A method for grammar checking of a computerized text, the method comprising:

preparing a collection of absolute grammatical rules defining substantially all possible text links;

applying said grammatical rules to parsed text for identifying grammatical errors in said text; and

providing at least one suggested correction which is grammatically correct according to said rules.

4. The method according to claim 3, further comprising:

preliminary sentence cleaning to remove errors in a close environment of a given word, before said step of applying.

5. The method according to claim 4, further comprising:

correcting null-words errors to remove unparsable words, after said step of sentence cleaning.

6. The method according to claim 5, further comprising false positive analysis to correct link errors incorrectly identified by said parser, after said step of correcting null-words errors.

8. The method according to claim 6, further comprising sentence structure analysis for analyzing structure of the text according to said grammatical rules.

10. A logical parser comprising:

a set of logical rules, using logical grammatical links, for parsing a text;

said logical rules including rules for identifying a part of speech of each word of text and all links between said words in said text, and labeling said links as grammatically correct links or grammatically incorrect links for correction, to parse completely said text.

11. A system for checking grammar of a computerized text, the system comprising:

a logical error identification module including;

a collection of absolute grammatical rules defining substantially all possible text links; and

an error-detection engine for applying said grammatical rules to parsed text for identifying grammatical errors and providing at least one suggested correction which is grammatically correct according to said rules.

12. The system according to claim 11, further comprising a parser for parsing substantially every word in said text and providing completely parsed text to said logical error correction module.

13. The system according to claim 11, further comprising a logical parser having a set of logical rules using logical grammatical links for parsing substantially every word in a text and providing completely parsed text to said logical error correction module.

14. The system according to claim 13, wherein

said logical rules include rules for identifying a part of speech of each word of text and all links between said words in said text, and labeling said links as grammatically correct links or grammatically incorrect links for correction, to parse completely said text;

and

said grammatical rules include rules for identifying said labeled links.

15. The system according to claim 11, wherein said parser utilizes a constituent tree.

16. The system according to claim 11, wherein said error detection engine includes a sentence cleaning module.

17. The system according to claim 11, wherein said error detection engine includes a null words cleaner module.

18. The system according to claim 11, wherein said error detection engine includes a false positive correction module.

19. The system according to claim 11, wherein said error detection engine includes a linkage analysis module.

20. The system according to claim 11, wherein said error detection engine includes a structure analysis module.