Sciweavers

11 search results - page 1 / 3
» Separating Dependency from Constituency in a Tree Rewriting ...
Sort
View
16
Voted
ENTCS
2007
121views more  ENTCS 2007»
13 years 5 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
COLING
2010
13 years 12 days ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
NAACL
2010
13 years 3 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
LREC
2008
143views Education» more  LREC 2008»
13 years 6 months ago
Enriching the Venice Italian Treebank with Dependency and Grammatical Relations
In this paper we propose a rule-based approach to extract dependency and grammatical relations from the Venice Italian Treebank (VIT) (Delmonte et al., 2007) with bracketed tree s...
Sara Tonelli, Rodolfo Delmonte, Antonella Bristot