Sciweavers

1064 search results - page 40 / 213
» Single Tree Grammars
Sort
View
LATA
2010
Springer
14 years 3 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
WCRE
2002
IEEE
14 years 1 months ago
Program Annotation in XML: A Parse-Tree Based Approach
In this paper we describe a technique that can be used to annotate source code with syntactic tags in XML format. This is achieved by modifying the parser generator bison to emit ...
James F. Power, Brian A. Malloy
EACL
1989
ACL Anthology
13 years 9 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
COLING
1990
13 years 9 months ago
Using Lexicalized Tags for Machine Translation
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out ...
Anne Abeillé, Yves Schabes, Aravind K. Josh...
FSTTCS
1998
Springer
14 years 2 days ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar