612 search results - page 57 / 123 » A Computational Grammar for Georgian |
132
click to vote
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
The main claim of this paper is that machine learning can help integrate the construction of ontologies and extraction grammars and lead us closer to the Semantic Web vision. The p...
157
click to vote
ACL
1990
15 years 2 months ago
1990
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
123
click to vote
IJBRA
2006
15 years 1 months ago
2006
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
COLING
2002
15 years 1 months ago
2002
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
104
click to vote
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we evaluate a method for on-line handwritten Kanji character recognition by describing the structure of Kanji using Stochastic Context-Free Grammar (SCFG), and exte...