1343 search results - page 53 / 269 » Learning to Complete Sentences |
117
click to vote
EMNLP
2006
15 years 5 months ago
2006
We propose a conditional random fieldbased method for supertagging, and apply it to the task of learning new lexical items for HPSG-based precision grammars of English and Japanes...
124
click to vote
COLING
2000
15 years 5 months ago
2000
This paper describes a self-modelling, incremental algorithm for learning translation rules from existing bilingual corpora. The notions of supracontext and subcontext are extende...
138
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
129
click to vote
ACL
2007
15 years 5 months ago
2007
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
154
click to vote
AAAI
2004
15 years 5 months ago
2004
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...