Sciweavers

621 search results - page 12 / 125
» Parsing As Tree Traversal
Sort
View
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
14 years 11 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
ACL
2007
13 years 11 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow
EMNLP
2007
13 years 11 months ago
Online Learning for Deterministic Dependency Parsing
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
Prashanth Mannem
ACL
2000
13 years 11 months ago
Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
David Chiang
IWPT
2001
13 years 11 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...