Account confirmers, Anti-spam team, Confirmed users, Bureaucrats and Sysops emeriti
4,925
edits
(More moving to the official page) |
No edit summary |
||
Line 39: | Line 39: | ||
!Mentor(s) | !Mentor(s) | ||
!Comments | !Comments | ||
|- | |||
|Built-in Grammar checking | |||
|This project would be divided into three parts : | |||
- A syntax analyser, able o build a semantic tree from a sentence, proceeding by substitutions according to a given set of grammar rules. | |||
- Basic grammar rules and dictionnary for the English language | |||
(At this point, the system should be able to interpret all possible meanings simple well-formed sentence) | |||
- A correction system, built in two parts. First, completing the syntax analyser so that it can "guess" the closest correctly formed sentences when the provided one doesn't match with the rules, and second by verifying that all built trees, therefore structurally correct, don't contain concordance mistakes, etc. | |||
It would probably not be ready for everyday use by the end of the SoC (due to the complexity of natural languages making it a lot of work to transcribe them into substitution rules for tree building) but the language-independant part of the system should be operational. | |||
|Arnaud VIÉ ([[User:Unas|Unas]]) | |||
| | |||
|This could also be implemented into Thunderbird. | |||
Plus, the syntax analyser could be used later as a basis in a translation tool too, when provided with a base of equivalence between words and sentence structures in two languages. | |||
|} | |} | ||