Sciweavers

482 search results - page 32 / 97
» Structural Equations in Language Learning
Sort
View
EACL
2009
ACL Anthology
14 years 9 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
AAAI
2004
13 years 10 months ago
Distributed Representation of Syntactic Structure by Tensor Product Representation and Non-Linear Compression
Representing lexicons and sentences with the subsymbolic approach (using techniques such as Self Organizing Map (SOM) or Artificial Neural Network (ANN)) is a relatively new but i...
Heidi H. T. Yeung, Peter W. M. Tsang
EMNLP
2009
13 years 6 months ago
Character-level Analysis of Semi-Structured Documents for Set Expansion
Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), w...
Richard C. Wang, William W. Cohen
IANDC
2007
81views more  IANDC 2007»
13 years 8 months ago
Some natural conditions on incremental learning
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
Sanjay Jain, Steffen Lange, Sandra Zilles
KES
2004
Springer
14 years 2 months ago
Representing Knowledge in Controlled Natural Language: A Case Study
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...
Rolf Schwitter