Novice

SEMINAR MARA

V ponedeljek, 20.10.2008, bo ob 17. uri  v  mali predavalnici  Fakultete za matematiko, naravoslovje in inforamcijske tehnologije Univerze na Primorskem, Glagoljaška 8,  Koper predavanji v okviru skupnega SEMINARJA ZA MATEMATICNE IN RAČUNALNIŠKE ZNANOSTI Oddelka za matematiko in računalništvo UP FAMNIT, Oddelka za matematiko in računalništvo UP PINT, Oddelka za matematiko in računalništvo UP PEF ter Oddelkov za matematiko in teoretično računalništvo IMFM.  

Dnevni red:

16:00 -- 17:00

Predavatelji: mag. Jernej Vičič

Naslov predavanja: Comparing greedy and optimal coverage strategies for shallow-transfer machine translation

Povzetek:

Using the open-source Apertium platform as an example of a shallow-transfer machine translation system and Spanish and Catalan data, we compare greedy (left-to-right, longest-match) and optimal-coverage strategies when chunking the input sentence using the left-hand-side patterns of shallow transfer rules. We find that, when rules are reasonably correct, there is almost no difference between both strategies. The selection of unreasonable rules (such as rules which delete or insert content words) may be curtailed by using a length modification penalty term.


17:00 -- 18:00

Predavatelji: doc. dr. Štefko Miklavič 

Naslov predavanja: Distance-balanced property of generalized Petersen graphs

Povzetek:

A graph X is said to be distance-balanced, whenever for any edge uv of X, the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. In this talk we prove the following conjecture of Jerebic, Klavzar and Rall: For any integer k greater or equal to 2, there exists a positive integer m, such that the generalized Petersen graph GP(n,k) is not distance-balanced if n is greater or equal to m.

 

Vljudno vabljeni!