Sciweavers

1999 search results - page 10 / 400
» Dependently Typed Grammars
Sort
View
COLING
1996
15 years 1 months ago
An Earley-type recognizer for dependency grammar
The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper d...
Vincenzo Lombardo, Leonardo Lesmo
IJCAI
1989
15 years 26 days ago
Chart Parsing of Flowgraphs
This paper will present a generalisation of chart parsing able to cope with the case where the object being parsed is a particular kind of diagram (a flowgraph) and the grammar is...
Rudi Lutz
EACL
2003
ACL Anthology
15 years 1 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
JMLR
2010
192views more  JMLR 2010»
14 years 6 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater
AI
2009
Springer
15 years 3 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz