Sciweavers

30 search results - page 2 / 6
» Efficiently building a parse tree from a regular expression
Sort
View
NAACL
2010
13 years 8 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
NJC
2006
102views more  NJC 2006»
13 years 10 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
BMCBI
2008
116views more  BMCBI 2008»
13 years 11 months ago
GBParsy: A GenBank flatfile parser library with high speed
Background: GenBank flatfile (GBF) format is one of the most popular sequence file formats because of its detailed sequence features and ease of readability. To use the data in th...
Tae-Ho Lee, Yeon-Ki Kim, Baek Hie Nahm
ICFP
2006
ACM
14 years 10 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
WIA
2000
Springer
14 years 2 months ago
Applications of Finite-State Transducers in Natural Language Processing
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
Lauri Karttunen