612 search results - page 10 / 123 » A Computational Grammar for Georgian |
ECEASST
2010
14 years 9 months ago
2010
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
COLING
2010
14 years 6 months ago
2010
Unknown words are a major issue for large-scale grammars of natural language. We propose a machine learning based algorithm for acquiring lexical entries for all forms in the para...
ACL
2010
14 years 9 months ago
2010
Statistical translation models that try to capture the recursive structure of language have been widely adopted over the last few years. These models make use of varying amounts o...
CSR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
110
click to vote
DLT
2006
15 years 1 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...