Bilingual dictionary discovery - Revision history

Ilnar.salimzyan at 00:02, 22 March 2018

2018-03-22T00:02:02Z

Ilnar.salimzyan at 22:32, 27 February 2018

2018-02-27T22:32:36Z

Ilnar.salimzyan at 22:32, 27 February 2018

2018-02-27T22:32:11Z

Unhammer: wops

2016-03-15T07:43:02Z

wops

Unhammer: /* Further reading */

2016-03-15T07:40:44Z

Unhammer: /* Further reading */

2015-02-09T11:34:12Z

Francis Tyers at 08:58, 14 July 2014

2014-07-14T08:58:56Z

Unhammer at 07:34, 14 July 2014

2014-07-14T07:34:59Z

Francis Tyers at 08:11, 13 July 2014

2014-07-13T08:11:36Z

Francis Tyers: /* Further reading */

2014-07-12T22:53:26Z

@@ Line 53: / Line 53: @@
 * [http://turing.cs.washington.edu/papers/mausam-acl-ijcnlp-09.pdf Compiling a Massive, Multilingual Dictionary via Probabilistic Inference]
 * [http://www.mt-archive.info/10/MTS-2013-Sato.pdf Terminology-driven Augmentation of Bilingual Terminologies]
-* https://sourceforge.net/p/apertium/svn/HEAD/tree/branches/turkic/bidixes2multidix.py might be helpful when getting started
+* https://github.com/IlnarSelimcan/projectt/blob/master/bidixes2multidix.py might be helpful when getting started
 ==Related pages==

@@ Line 53: / Line 53: @@
 * [http://turing.cs.washington.edu/papers/mausam-acl-ijcnlp-09.pdf Compiling a Massive, Multilingual Dictionary via Probabilistic Inference]
 * [http://www.mt-archive.info/10/MTS-2013-Sato.pdf Terminology-driven Augmentation of Bilingual Terminologies]
-==Code==
 * https://sourceforge.net/p/apertium/svn/HEAD/tree/branches/turkic/bidixes2multidix.py might be helpful when getting started

@@ Line 53: / Line 53: @@
 * [http://turing.cs.washington.edu/papers/mausam-acl-ijcnlp-09.pdf Compiling a Massive, Multilingual Dictionary via Probabilistic Inference]
 * [http://www.mt-archive.info/10/MTS-2013-Sato.pdf Terminology-driven Augmentation of Bilingual Terminologies]
+==Code==
+* https://sourceforge.net/p/apertium/svn/HEAD/tree/branches/turkic/bidixes2multidix.py might be helpful when getting started
 ==Related pages==

@@ Line 55: / Line 55: @@
 ==Related pages==
-* [[Task ideas for Google Code-in/Grow bilingual]]
 * [[Ideas for Google Summer of Code/Improved bilingual dictionary induction]]
 * [[Building dictionaries#Generating bilingual dictionary entries]]

@@ Line 53: / Line 53: @@
 * [http://turing.cs.washington.edu/papers/mausam-acl-ijcnlp-09.pdf Compiling a Massive, Multilingual Dictionary via Probabilistic Inference]
 * [http://www.mt-archive.info/10/MTS-2013-Sato.pdf Terminology-driven Augmentation of Bilingual Terminologies]
+==Related pages==
+* [[Task ideas for Google Code-in/Grow bilingual]]
+* [[Ideas for Google Summer of Code/Improved bilingual dictionary induction]]
+* [[Building dictionaries#Generating bilingual dictionary entries]]
 [[Category:Development]]

← Older revision		Revision as of 08:58, 14 July 2014
Line 1:		Line 1:
			{{TOCD}}
	This page describes a way of discovering new bilingual, or multilingual dictionaries.		This page describes a way of discovering new bilingual, or multilingual dictionaries.

@@ Line 21: / Line 21: @@
 You could then cluster the words using some "strongly-connected subgraph"<ref>http://en.wikipedia.org/wiki/Strongly_connected_components</ref> algorithm. Then assume that the sets of words within a strongly-connected subgraph are translations of each other. Meaning that you could get кил--йорт without having any direct correspondence.
+==vs crossdics==
-Restrictions on sub-graphs:
+кил--йорт are not strongly-connected to each other, but hypothesising an arc between them would make them a strongly-connected subgraph along with ev and дом. The size of the strongly-connected subgraph (here: 4) could be an indicator of the strength of the association, but strongly-connected subgraphs might be too hard a requirement.
+You could still get кил--йорт through crossdics. If crossdics gives the subgraphs of size 3 (where one arc is hypothesized), then the intersection of runs of crossdics (chv-rus-tat and chv-tur-tat) doesn't necessarily give the subgraphs of size 4 – that would require the rus-tur connection as well, while the crossdics intersection doesn't require that.
+Two things we wouldn't get from crossdics:
+# the fact that even with one arc missing, [[File:3graph+1via.png|130px]] is still stronger than the simple chv-rus-tat crossdics (due to the extra route via tur),
+# the possibility of adding translations where both crossings would have lacunae, but doublecrossing shows a translation: [[File:2via.png|130px]]
+#: possibly a bad translation, but if there are no shorter paths for either word, it might be worth it
+==Restrictions on sub-graphs:==
 * Only one word per input language
@@ Line 27: / Line 37: @@
 * Only accept words where there is a cycle(?)
-Some ideas:
+==Some ideas:==
 * Weighting