Sciweavers

612 search results - page 83 / 123
» A Computational Grammar for Georgian
Sort
View
HICSS
2007
IEEE
135views Biometrics» more  HICSS 2007»
15 years 7 months ago
Composable Language Extensions for Computational Geometry: A Case Study
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Eric Van Wyk, Eric Johnson
PPDP
2007
Springer
15 years 7 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
JIIS
2008
89views more  JIIS 2008»
15 years 1 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
INFORMATICALT
2002
134views more  INFORMATICALT 2002»
15 years 1 months ago
The Implementation of the Example-Based Machine Translation Technique for German-to-Polish Automatic Translation System
High-quality machine translation between human languages has for a long time been an unattainable dream for many computer scientists involved in this fascinating and interdisciplin...
Miroslaw Gajer
ACL
2008
15 years 2 months ago
Efficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
Michaela Regneri, Markus Egg, Alexander Koller