Sciweavers

612 search results - page 60 / 123
» A Computational Grammar for Georgian
Sort
View
LICS
2008
IEEE
15 years 7 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
NIPS
2001
15 years 2 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 1 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
COLING
2002
15 years 1 months ago
Linking Syntactic and Semantic Arguments in a Dependency-based Formalism
We propose a formal characterization of variation in the syntactic realization of semantic arguments, using hierarchies of syntactic relations and thematic roles, and a mechanism ...
Christian Korthals, Ralph Debusmann
SCP
1998
112views more  SCP 1998»
15 years 1 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer