Feigenbaum test and semantic disambiguation

Now it is patent that there cannot be successful  Feigenbaum test (i.e. not only occasional Feigenbaum hits, but regular and average performance) without an adequate treatment of semantic disambiguation. Arguably, it is one hard problem of machine translation. Here are some typical instances:

 

 

  • ‘défense’: defense/tusk; Corsican: difesa/sanna
  • ‘fils’: sons/wires; Corsican: figlioli/fili
  • ‘comprendre’:
    understand/comprise; Corsican: capisce/cumprende
  • ‘vol’: flight/theft; Corsican: bulu/arrubecciu
  • ‘voler’: fly/steal; Corsican: bulà/arrubà
  • ‘échecs’: chess/failures; Corsican: scacchi/fiaschi
  • and the fourfold ambiguous ‘palais’: palace/palaces/palate/palates; Corsican: palazzu/palazzi/palate/palates

In short: no successful semantic disambiguation = no genuine successful  Feigenbaum test. Semantic disambiguation engine needs to be rewritten.

This entry was posted in blog and tagged , , . Bookmark the permalink.