Community:SummerOfCode10:Brainstorming: Difference between revisions

Community:SummerOfCode10:Brainstorming (view source)

Revision as of 08:36, 3 November 2010

1,453 bytes removed , 3 November 2010

m

Reverted edits by KaanTM (talk) to last revision by Gerv

Gerv

Account confirmers, Anti-spam team, Confirmed users, Bureaucrats and Sysops emeriti

4,925

edits

@@ Line 30: / Line 30: @@
 |}
-== Firefox  ==
+==Firefox==
 {| class="standard-table"
 |-
-! Title
+!Title
-! Abstract - links to details/bugs/etc
+!Abstract - links to details/bugs/etc
-! Reporter
+!Reporter
-! Mentor(s)
+!Mentor(s)
-! Comments
+!Comments
 |-
-| Automatic Element Anchors
+|Built-in Grammar checking
-| When the browser encounters an undefined numerical anchor in the url, it should interpret this as an element number and scroll the page so that the element is at the very top of the view area.
+|This project would be divided into three parts :
-I would suggest elements be counted as such:
-*Element 0 is the body tag.
+- A syntax analyser, able o build a semantic tree from a sentence, proceeding by substitutions according to a given set of grammar rules.
-*Non printing tags such as: script and a(with name attribute) should never be counted.
-*Visible non text tags such as img, object and canvas should always be counted.<br>
-*Table rows (tr) should always be counted unless they do not contain any th or td tags. The tags td and th should not be counted, however if tags within td and th should be counted provided they fit the other rules.
-*If no printing characters are encountered between the opening tag and either the same elements closing tag or another elements opening tag it should not be counted.
-*Unenclosed text nodes should be counted as if they were surrounded by span.
-<br>
+- 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)
-An example:
+- 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.
-&lt;body&gt;&lt;div class="nocount"&gt;&lt;p&gt;This is element #1&lt;/p&gt;&lt;p&gt;This is element #2&lt;/p&gt;&lt;p class="nocount"&gt;&lt;/p&gt;&lt;p&gt;This is element #3&lt;/p&gt;&lt;p class="nocount"&gt;&lt;span&gt;This is element #4&lt;/span&gt;This is element #5 &lt;/p&gt;&lt;div&gt;&lt;body&gt;
+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.
-This would let people link to specific parts of documents that are not associated with any html anchor tags.
+|Arnaud VIÉ ([[User:Unas|Unas]])
+|
-| E. Kaan Atakan ([[User:KaanTM|KaanTM]])
+|This could also be implemented into Thunderbird.
-|
-|
-|-
-| Built-in Grammar checking
-| This project would be divided into three parts&nbsp;:
-- 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.
+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.
 |}

Community:SummerOfCode10:Brainstorming: Difference between revisions

Community:SummerOfCode10:Brainstorming (view source)

Revision as of 08:36, 3 November 2010

Navigation menu

Search