Learning Constraint Grammars - Revision history

Nuboro at 22:59, 25 December 2016

2016-12-25T22:59:44Z

Putti at 12:39, 22 December 2016

2016-12-22T12:39:16Z

Putti at 12:27, 22 December 2016

2016-12-22T12:27:37Z

Putti at 12:25, 22 December 2016

2016-12-22T12:25:46Z

Putti at 12:25, 22 December 2016

2016-12-22T12:25:16Z

Putti at 12:15, 22 December 2016

2016-12-22T12:15:05Z

Putti: Created page with "Constraint Grammar style part-of-speech disambiguation rules can be learned automatically from disambiguated parallel corpora. == Statistical approach == In statistical app..."

2016-12-22T11:51:22Z

Created page with "Constraint Grammar style part-of-speech disambiguation rules can be learned automatically from disambiguated parallel corpora. == Statistical approach == In statistical app..."

New page

Constraint Grammar style part-of-speech disambiguation rules can be learned automatically from disambiguated parallel corpora.

== Statistical approach ==

In statistical approach Constraint Grammar style rules are learned by calculating n-gram probabilities of word and part-of-speech tag groups. Current work on implementing such a system is at [https://github.com/nuboro/CG_module/ nuboro's Github repository], and it is based on the paper [https://archive.org/details/arxiv-cmp-lg9607002 Inducing Constraint Grammars].

@@ Line 4: / Line 4: @@
 == Statistical approach ==
-In statistical approach Constraint Grammar style rules are learned by calculating n-gram probabilities of word and part-of-speech tag groups. Current work on implementing such a system is at [https://github.com/nuboro/CG_module/ nuboro's Github repository], and it is based on the paper [https://archive.org/details/arxiv-cmp-lg9607002 Inducing Constraint Grammars].
+In statistical approach Constraint Grammar style rules are learned by calculating n-gram probabilities of word and part-of-speech tag groups. Current work on implementing such a system is at [https://github.com/nuboro/CG-generator nuboro's Github repository], and it is based on the paper [https://archive.org/details/arxiv-cmp-lg9607002 Inducing Constraint Grammars].
 == Machine Learning ==

@@ Line 13: / Line 13: @@
 * http://swarm.cs.pub.ro/~asfrent/msc/thesis.pdf – Inductive Logic Programming
 * http://ucrel.lancs.ac.uk/acl/C/C98/C98-2123.pdf – Inductive Logic Programming
+[[Category:Constraint Grammar]]

@@ Line 10: / Line 10: @@
 A subfield of Machine Learning, called Inductive Logic Programming, has been used to learn Constraint Grammar style disambiguation rules. See for example the branch [http://svn.code.sf.net/p/apertium/svn/branches/mil-pos-tagger/ mil-pos-tagger].
-==External links==
+==Papers==
 * http://swarm.cs.pub.ro/~asfrent/msc/thesis.pdf – Inductive Logic Programming
 * http://ucrel.lancs.ac.uk/acl/C/C98/C98-2123.pdf – Inductive Logic Programming

@@ Line 8: / Line 8: @@
 == Machine Learning ==
-A subfield of Machine Learning, called Inductive Logic Programming, has been used to learn Constraint Grammar style disambiguation rules. See for example the branch [http://svn.code.sf.net/p/apertium/svn/branches/mil-pos-tagger/ mil-pos-tagger]
+A subfield of Machine Learning, called Inductive Logic Programming, has been used to learn Constraint Grammar style disambiguation rules. See for example the branch [http://svn.code.sf.net/p/apertium/svn/branches/mil-pos-tagger/ mil-pos-tagger].
 ==External links==

@@ Line 9: / Line 9: @@
 A subfield of Machine Learning, called Inductive Logic Programming, has been used to learn Constraint Grammar style disambiguation rules. See for example the branch [http://svn.code.sf.net/p/apertium/svn/branches/mil-pos-tagger/ mil-pos-tagger]
+==External links==
+* http://swarm.cs.pub.ro/~asfrent/msc/thesis.pdf – Inductive Logic Programming
+* http://ucrel.lancs.ac.uk/acl/C/C98/C98-2123.pdf – Inductive Logic Programming