Sciweavers

107 search results - page 2 / 22
» A Grammar Based Approach To A Grammar Checking Of Free Word ...
Sort
View
ACL
1993
13 years 7 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
COLING
2008
13 years 7 months ago
Hybrid Processing for Grammar and Style Checking
This paper presents an implemented hybrid approach to grammar and style checking, combining an industrial patternbased grammar and style checker with bidirectional, large-scale HP...
Berthold Crysmann, Nuria Bertomeu, Peter Adolphs, ...
COLING
1992
13 years 7 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva
ICGI
2010
Springer
13 years 3 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
CPP
2011
107views more  CPP 2011»
12 years 5 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge