Sciweavers

2834 search results - page 316 / 567
» Representing Trees with Constraints
Sort
View
EMNLP
2007
15 years 8 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
NIPS
2007
15 years 8 months ago
A Probabilistic Approach to Language Change
We present a probabilistic approach to language change in which word forms are represented by phoneme sequences that undergo stochastic edits along the branches of a phylogenetic ...
Alexandre Bouchard-Côté, Percy Liang,...
DMIN
2006
160views Data Mining» more  DMIN 2006»
15 years 8 months ago
MF-tree: Extracting and Clustering the Structural Features from Music Object in MusicXML
In the music information retrieval field, the most important topic is to extract the feature which represents the content from the music objects. The content feature is useful for ...
Yu-Chih Shen, Jia-Lien Hsu, Shuk-Chun Chung
IC
2004
15 years 8 months ago
Area-Efficient Visualization of Web Data
With the explosion of the Internet the World Wide Web today has become an infinite source of information. Hence, it is important that one be able to categorize, understand and be a...
Vishal Anand, Keith Hansen, Radu Jianu, Adrian Rus...
APPINF
2003
15 years 8 months ago
A Comparison of Structure-generic Relational Storage Schemes of XML Data
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
Weining Zhang, Douglas Pollok