• No results found

Learning Constraint Grammar style disambiguation rules using Inductive Logic Programming

N/A
N/A
Protected

Academic year: 2020

Share "Learning Constraint Grammar style disambiguation rules using Inductive Logic Programming"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)
(2)
(3)
(4)
(5)

Figure

Table 1: 'Idioms'. Unambiguous word sequences found in the training data.

References

Related documents

this aspect, I don’t feel like I’m alone, and I think this is why a good number of people. never

The overall brake performance due to drum type foundation brake can be attributed to two criteria: 1) dimensional design parameters of foundation.. brake, and 2) friction between

Questions concerning what happened to the former chief executive officer of the American Samoa TeleCommunications Authority as well as the ASTCA board off island trips were some

An Economic Impact Analysis of Orange County Trails, prepared by the East Central Florida Regional Planning Association revealed that more than 1.7 million

NOTE: you can also press [AUTO SCAN] button to enter “Automatic Channel Search” while enjoying DVB-T TV/Radio.. Press [OK] button to start

State, 9 the rule was promulgated by the Texas Court of Criminal Appeals that evidence of felony theft, i.e., that the value of the article was over $50., was not

The first set of results on salience is presented in Table 5, which regresses logarithm of number of applications on rank, whether or not the ranking is salient, and the interaction

The function signature refactoring scheme makes it easy to define function-related refactorings: the parametrisation is a single rewrite rule defining the way the name as well as