759 search results - page 30 / 152 » Odometers on Regular Languages |
105
click to vote
ACL
2007
14 years 11 months ago
2007
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
CSL
2007
Springer
15 years 4 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current versi...