Sciweavers

656 search results - page 1 / 132
» Marrying Words and Trees
Sort
View
CSR
2007
Springer
13 years 10 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
ACL
2011
12 years 8 months ago
Using Derivation Trees for Treebank Error Detection
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
Seth Kulick, Ann Bies, Justin Mott
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 8 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
DIS
2006
Springer
13 years 8 months ago
Experiences from a Socio-economic Application of Induction Trees
This paper presents a full scaled application of induction trees for non-classificatory purposes. The grown trees are used for highlighting regional differences in the women's...
Fabio B. Losa, Pau Origoni, Gilbert Ritschard
COLING
2008
13 years 6 months ago
Word Sense Disambiguation for All Words using Tree-Structured Conditional Random Fields
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
Jun Hatori, Yusuke Miyao, Jun-ichi Tsujii