618 search results - page 50 / 124 » Computational Models of Natural Language Argument |
ACL
1997
14 years 11 months ago
1997
We describe a simple variant of the interpolated Markov model with nonemitting state transitions and prove that it is strictly more powerful than any Markov model. More importantl...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
For centuries, scholars have explored the deep links among human languages. In this paper, we present a class of probabilistic models that use these links as a form of naturally o...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
ECCC
2008
14 years 9 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
BIRTHDAY
2009
Springer
14 years 11 months ago
2009
Springer
This article presents the evaluation of a valence dictionary for Polish produced with the help of shallow parsing techniques and compares those results to earlier results involving...