Sciweavers

877 search results - page 58 / 176
» How to Cover a Grammar
Sort
View
108
Voted
CATS
2007
15 years 2 months ago
Constructing Strictly Positive Families
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
Peter Morris, Thorsten Altenkirch, Neil Ghani
74
Voted
COLING
2008
15 years 2 months ago
Computer Aided Correction and Extension of a Syntactic Wide-Coverage Lexicon
The effectiveness of parsers based on manually created resources, namely a grammar and a lexicon, rely mostly on the quality of these resources. Thus, increasing the parser covera...
Lionel Nicolas, Benoît Sagot, Miguel A. Moli...
86
Voted
LREC
2010
135views Education» more  LREC 2010»
15 years 2 months ago
Partial Dependency Parsing for Irish
In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unres...
Elaine Uí Dhonnchadha, Josef van Genabith
94
Voted
LREC
2010
153views Education» more  LREC 2010»
15 years 2 months ago
Developing a Deep Linguistic Databank Supporting a Collection of Treebanks: the CINTIL DeepGramBank
Corpora of sentences annotated with grammatical information have been deployed by extending the basic lexical and morphological data with increasingly complex information, such as...
António Branco, Francisco Costa, Joã...
131
Voted
ACL
1990
15 years 1 months ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker